On the average codeword length of optimal binary codes for extended sources (Corresp.)

DOI10.1109/TIT.1987.1057280MaRDI QIDQ3764050zbMATH OpenOpenAlexFDO

Authors B. L. Montgomery, B. V. K. Vijaya Kumar

Publication date 1987

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

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

zbMATH Keywords

average codeword lengthbinary source coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 3932941
• Binary prefix codes ending in a "1"
• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• scientific article; zbMATH DE number 4063000
• Codes with monotonic codeword lengths

Cited in

(11)

• scientific article; zbMATH DE number 3920367 (Why is no real title available?)
• Development of two new mean codeword lengths
• A novel block-based scheme for arithmetic coding
• Combinatorial properties of good codes for binary autoregressive sources (Corresp.)
• On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
• Bounding the Average Length of Optimal Source Codes Via Majorization Theory
• The Minimum Average Code for Finite Memoryless Monotone Sources
• Codes with monotonic codeword lengths
• scientific article; zbMATH DE number 3932941 (Why is no real title available?)
• On the redundancy achieved by Huffman codes
• Bit probabilities of optimal binary source codes

This page was built for publication: On the average codeword length of optimal binary codes for extended sources (Corresp.)

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