DocumentCode
2471679
Title
On the redundancy and data expansion of Huffman codes
Author
De Prisco, Roberto ; De Santis, Alfredo
Author_Institution
Lab. for Comput. Sci., MIT, Cambridge, MA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
272
Abstract
In this paper we provide some new results on the redundancy and the data expansion of Huffman codes. In particular we prove that the data expansion δ of a Huffman code is upper bounded by δ<1.256
Keywords
Huffman codes; probability; redundancy; source coding; Huffman codes; data expansion; redundancy; source coding; upper bound; Bibliographies; Binary codes; Computer science; Decoding; Encoding; Entropy; Frequency; Particle measurements; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708877
Filename
708877
Link To Document