Title :
New bounds on the redundancy of Huffman codes
Author :
Capocelli, Renato M. ; De Santis, Alfredo
Author_Institution :
Dipartimento di Matematica, Roma Univ., Italy
fDate :
7/1/1991 12:00:00 AM
Abstract :
Upper and lower bounds are obtained for the redundancy of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Tight upper bounds on redundancy in terms of the most and least likely source letter probabilities are provided
Keywords :
codes; redundancy; Huffman codes; binary codes; lower bounds; memoryless source; redundancy; upper bounds; Councils; Entropy; Senior members; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
