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

This paper presents the lower bound on the average codeword length of the D-ary Huffman codes. Two extreme cases are analyzed: the quasi-uniform and anti-uniform Huffman codes. For each case the codeword lengths are computed. The histogram of the average codeword length obtained by simulation confirms the bound on the average codeword lengths. The lower bound computed in this paper is lower than the value obtained for Huffman codes with minimum redundancy.