The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths

DOI10.1109/tit.2022.3218212OpenAlexW4312990838WikidataQ123136808 ScholiaQ123136808MaRDI QIDQ6193993

Spencer Congero, Unnamed Author

Publication date: 19 March 2024

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

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

zbMATH Keywords

prefix codesHuffman codesKraft inequalityunique decodability

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

This page was built for publication: The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths