On the Redundancy Achieved by Huffman Codes
暂无分享,去创建一个
[1] Alfredo De Santis,et al. New bounds on the redundancy of Huffman codes , 1991, IEEE Trans. Inf. Theory.
[2] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[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] B. V. K. Vijaya Kumar,et al. On the average codeword length of optimal binary codes for extended sources , 1987, IEEE Trans. Inf. Theory.
[7] Alfredo De Santis,et al. Tight upper bounds on the redundancy of Huffman codes , 1989, IEEE Trans. Inf. Theory.
[8] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[9] Fazlollah M. Reza,et al. Introduction to Information Theory , 2004, Lecture Notes in Electrical Engineering.
[10] Masud Mansuripur,et al. Introduction to information theory , 1986 .
[11] Yasuichi Horibe. An Improved Bound for Weight-Balanced Tree , 1977, Inf. Control..
[12] Gyula O. H. Katona,et al. Huffman codes and self-information , 1976, IEEE Trans. Inf. Theory.