Binary prefix codes ending in a "1"

DOI10.1109/18.335933zbMath0811.94025OpenAlexW2123950685MaRDI QIDQ4324207

Alfredo De Santis, Giuseppe Persiano, Renato M. Capocelli

Publication date: 1 March 1995

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

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

zbMATH Keywords

upper and lower boundsredundancysearch methodsoptimal codesvariable-length coding1-ended codes

Mathematics Subject Classification ID

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

Related Items

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