DocumentCode
1401823
Title
A new bound for the data expansion of Huffman codes
Author
De Prisco, Roberto ; De Santis, Alfredo
Author_Institution
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
Volume
43
Issue
6
fYear
1997
fDate
11/1/1997 12:00:00 AM
Firstpage
2028
Lastpage
2032
Abstract
In this correspondence, we prove that the maximum data expansion δ of Huffman codes is upper-bounded by δ<1.39. This bound improves on the previous best known upper bound δ<2. We also provide some characterizations of the maximum data expansion of optimal codes
Keywords
Huffman codes; source coding; Huffman codes; maximum data expansion; optimal codes; upper bound; Information theory; Mathematical analysis; Source coding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.641572
Filename
641572
Link To Document