Title :
A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.)
Author :
Smith, Stephen A.
fDate :
1/1/1974 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1974.1055147
