DocumentCode
1424955
Title
The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
Author
Birmiwal, Kailash
Author_Institution
Dept. of Electr. Eng., Southern Illinois Univ., Carbondale, IL, USA
Volume
36
Issue
2
fYear
1990
fDate
3/1/1990 12:00:00 AM
Firstpage
439
Lastpage
443
Abstract
Bounds to the length of the shortest codeword in a binary Huffman code are obtained. Among them are bounds assuming knowledge of different subsets of the probability distribution. Each is shown to be the tightest possible bound for the subset of probabilities it presumes. Two lower bounds to the redundancy of the Huffman code are also obtained. They are also shown to be the tightest possible bounds
Keywords
error correction codes; redundancy; binary Huffman code; lower bounds; minimum codeword length; probability distribution; redundancy; uncertain sources; Encoding; Entropy; Probability distribution; Sufficient conditions; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.52498
Filename
52498
Link To Document