On multiset decipherable codes (Corresp.)

DOI10.1109/TIT.1986.1057217zbMath0619.94019MaRDI QIDQ3757831

Abraham Lempel

Publication date: 1986

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

zbMATH Keywords

prefix codesuffix codedecipherabilityMSD codemultiset of codewords

Mathematics Subject Classification ID

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

Related Items (11)

A fast algorithm for the unique decipherability of multivalued encodings ⋮ Factorization in Formal Languages ⋮ On numerically decipherable codes and their homophonic partitions ⋮ Structure of decoders for multivalued encodings ⋮ The finest homophonic partition and related code concepts ⋮ Coding by minimal linear grammars ⋮ Multiset and set decipherable codes ⋮ Unique decipherability in formal languages ⋮ CODING PARTITIONS OF REGULAR SETS ⋮ FULL MONOIDS AND MAXIMAL CODES ⋮ Variants of codes and indecomposable languages

This page was built for publication: On multiset decipherable codes (Corresp.)