DocumentCode
920891
Title
A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.)
Author
Smith, Stephen A.
Volume
20
Issue
1
fYear
1974
fDate
1/1/1974 12:00:00 AM
Firstpage
124
Lastpage
125
Abstract
A generalization of the Huffman coding procedure is given for cases in which the source letter probabilities are known only to fall in certain ranges.
Keywords
Huffman codes; Bismuth; Convergence; Data compression; Frequency; Huffman coding; Probability distribution; Random variables; Rate distortion theory; Rate-distortion; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1974.1055147
Filename
1055147
Link To Document