A note on multiset decipherable codes

DOI10.1109/18.30991MaRDI QIDQ3832470zbMATH OpenOpenAlexFDO

Authors Antonio Restivo

Publication date 1989

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

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

zbMATH Keywords

MSD codemultiset decipherable codesprefix codesuffix code

Mathematics Subject Classification ID

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

Cited in

(12)

• A fast algorithm for the unique decipherability of multivalued encodings
• Coding by minimal linear grammars
• Unique decipherability in formal languages
• On numerically decipherable codes and their homophonic partitions
• Full monoids and maximal codes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• Coding partitions of regular sets
• Factorization in formal languages
• Multiset and set decipherable codes
• Decoding multivariate multiplicity codes on product sets
• Unique decipherability in the monoid of languages: an application of rational relations

This page was built for publication: A note on multiset decipherable codes

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