DocumentCode :
931316
Title :
On the redundancy of binary Huffman codes (Corresp.)
Author :
Johnsen, Ottar
Volume :
26
Issue :
2
fYear :
1980
fDate :
3/1/1980 12:00:00 AM
Firstpage :
220
Lastpage :
222
Abstract :
Some properties of Huffman codes are presented. It is shown that knowing the probability 
of the most likely source letter, there exist new lower and upper bounds on the redundancy of the Huffman code which are tighter for 
than those given by Shannon\´s first theorem or by the more recent results of Gallager. It is also shown that the new bounds are the tightest possible for when it is supposed that PI is the only known probability.
of the most likely source letter, there exist new lower and upper bounds on the redundancy of the Huffman code which are tighter for than those given by Shannon\´s first theorem or by the more recent results of Gallager. It is also shown that the new bounds are the tightest possible for when it is supposed that PI is the only known probability.Keywords :
Huffman codes; Concatenated codes; Decoding; Electrons; Entropy; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1980.1056158
Filename :
1056158
Link To Document :
