A note on multiset decipherable codes

DOI10.1109/18.30991zbMath0676.94018OpenAlexW1984800684MaRDI QIDQ3832470

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

prefix codesuffix codemultiset decipherable codesMSD code

Mathematics Subject Classification ID

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

Related Items (9)

Factorization in Formal Languages ⋮ On numerically decipherable codes and their homophonic partitions ⋮ Coding by minimal linear grammars ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ Multiset and set decipherable codes ⋮ Unique decipherability in formal languages ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations ⋮ CODING PARTITIONS OF REGULAR SETS ⋮ FULL MONOIDS AND MAXIMAL CODES

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