An algorithm for optimal prefix parsing of a noiseless and memoryless channel

DOI10.1109/TIT.1973.1054981zbMath0251.94018OpenAlexW2159253410MaRDI QIDQ5665110

Shimon Even, Abraham Lempel, Martin Cohn

Publication date: 1973

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

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Probabilistic Amplitude Shaping ⋮ Note on the greedy parsing optimality for dictionary-based text compression

This page was built for publication: An algorithm for optimal prefix parsing of a noiseless and memoryless channel