A new bound for the data expansion of Huffman codes

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.

[1]  Gyula O. H. Katona,et al.  Huffman codes and self-information , 1976, IEEE Trans. Inf. Theory.

[2]  Alfredo De Santis,et al.  Tight upper bounds on the redundancy of Huffman codes , 1989, IEEE Trans. Inf. Theory.

[3]  Raymond W. Yeung.  Local redundancy and progressive bounds on the redundancy of a Huffman code , 1991, IEEE Trans. Inf. Theory.

[4]  Inder Jeet Taneja,et al.  Bounds on the redundancy of Huffman codes , 1986, IEEE Trans. Inf. Theory.

[5]  Dietrich Manstetten.  Tight bounds on the redundancy of Huffman codes , 1992, IEEE Trans. Inf. Theory.

[6]  Alfredo De Santis,et al.  On Lower Bounds for the Redundancy of Optimal Codes , 1998, Des. Codes Cryptogr..

[7]  Alfredo De Santis,et al.  New bounds on the redundancy of Huffman codes , 1991, IEEE Trans. Inf. Theory.

[8]  Alfredo De Santis,et al.  On the Redundancy Achieved by Huffman Codes , 1996, Inf. Sci..

[9]  Alfredo De Santis,et al.  A note on D-ary Huffman codes , 1991, IEEE Trans. Inf. Theory.

[10]  B. V. K. Vijaya Kumar,et al.  On the average codeword length of optimal binary codes for extended sources , 1987, IEEE Trans. Inf. Theory.

[11]  Yasuichi Horibe.  An Improved Bound for Weight-Balanced Tree , 1977, Inf. Control..

[12]  ROBERTO DE PRISCO.  On the Redundancy Achieved by Huuman Codes , 1994 .

[13]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[14]  Ottar Johnsen,et al.  On the redundancy of binary Huffman codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[15]  Julia Abrahams,et al.  On the redundancy of optimal binary prefix-condition codes for finite and infinite sources , 1987, IEEE Trans. Inf. Theory.

[16]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[17]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[18]  Michelle Effros,et al.  Data expansion with Huffman codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.