Title :
A note on D-ary Huffman codes
Author :
Capocelli, Rcnato M. ; De Santis, Alfredo
Author_Institution :
Dipartimento di Matematica, Roma Univ., Italy
fDate :
1/1/1991 12:00:00 AM
Abstract :
An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p1 of the most likely source letter is provided. For large values of p1, 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
Keywords :
codes; redundancy; D-ary Huffman codes; most likely source letter; probability; redundancy; tight lower bound; upper bound; Binary codes; Councils; Decoding; Entropy; Information theory; Random variables; Source coding; Sufficient conditions; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
