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

DOI10.1109/TIT.1987.1057280zbMath0627.94015OpenAlexW2076803615MaRDI QIDQ3764050

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)

Related Items (1)

On the redundancy achieved by Huffman codes

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