On the Maximum Length of Huffman Codes
暂无分享,去创建一个
Abstract In this paper the maximum length of binary Huffman codes is investigated dependent on the two lowest probabilities of encoded symbols. Furthermore, the structure of full binary trees with a given number of leaves, a limited depth, and maximum external path length is examined to get an improved upper bound on the external path length of Huffman trees.
[1] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[2] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .