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
fDate :
3/1/1990 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
