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.