A new bound for the data expansion of Huffman codes
Roberto De Prisco, Alfredo De Santis · IEEE Transactions on Information Theory · 1997
In this correspondence, we prove that the maximum data expansion /spl delta/ of Huffman codes is upper-bounded by /spl delta/<1.39. This bound improves on the previous best known upper bound /spl delta/<2. We also provide some characterizations of the maximum data expansion of optimal codes.