A lower bound on the redundancy of D -ary Huffman codes (Corresp.)

A necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with a D -ary Huffman code, 2 \leq D , is derived. As a consequence, a lower bound on the redundancy of a D -ary Huffman code is established.