A note on uniquely decipherable codes (Corresp.)

DOI10.1109/TIT.1979.1056005MaRDI QIDQ4170648zbMATH OpenFDO

Authors Renato M. Capocelli

Publication date 1979

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

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

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Synchronization error-correcting codes (94B50)

Cited in

(4)

• The space complexity of the unique decipherability problem
• On optimal factorization of free semigroups into free subsemigroups
• A fast algorithm for the unique decipherability of multivalued encodings
• On infinitary finite length codes

This page was built for publication: A note on uniquely decipherable codes (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170648)