The minimum codeword length and redundancy in the binary Huffman code for uncertain sources

DOI10.1109/18.52498MaRDI QIDQ3484770zbMATH OpenOpenAlexFDO

Authors Kailash Birmiwal

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.52498

zbMATH Keywords

lower boundsprobability distributionredundancybinary Huffman codeshortest codeworduncertain sources

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Bounds on codes (94B65)

Recommendations

• On the redundancy of binary Huffman codes (Corresp.)
• New bounds on the redundancy of Huffman codes
• Tight bounds on the redundancy of Huffman codes
• Tight upper bounds on the redundancy of Huffman codes
• Bounds on the redundancy of Huffman codes (Corresp.)

Cited in

(6)

• The length of a typical Huffman codeword
• Bernstein polynomials and learning theory
• Bounding the Average Length of Optimal Source Codes Via Majorization Theory
• Maximal codeword lengths in Huffman codes
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• A simple upper bound on the redundancy of Huffman codes

This page was built for publication: The minimum codeword length and redundancy in the binary Huffman code for uncertain sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484770)