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
fDate :
11/1/1997 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
