A note on D-ary Huffman codes

An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p/sub 1/ of the most likely source letter is provided. For large values of p/sub 1/, the bound improves the one given by R.G. Gallager (1978). Additionally, some results known for the binary case (D=2) are extended to arbitrary D-ary Huffman codes. As a consequence, a tight lower bound that corrects a bound recently proposed by J.D. Golic and M.M. Obradovic (1987) is derived.<
>