Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1

This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.