Optimum '1'-ended binary prefix codes

DOI10.1109/18.59940zbMath0713.94009OpenAlexW2140744908MaRDI QIDQ3199322

Toby Berger, Raymond W. Yeung

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.59940

zbMATH Keywords

Lower and upper boundsbinary prefix code of minimum average codeword length

Mathematics Subject Classification ID

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

Related Items (1)

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

This page was built for publication: Optimum '1'-ended binary prefix codes