A lower bound on the redundancy ofD-ary Huffman codes (Corresp.)
Jovan Dj. Golić, Milutin Obradović · IEEE Transactions on Information Theory · 1987
A necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with aD-ary Huffman code,2 \leq D < \infty, is derived. As a consequence, a lower bound on the redundancy of aD-ary Huffman code is established.