On multiset decipherable codes (Corresp.)

DOI10.1109/TIT.1986.1057217MaRDI QIDQ3757831zbMATH OpenFDO

Authors 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)

Recommendations

• Multiset and set decipherable codes
• On the set of uniquely decodable codes with a given sequence of code word lengths
• On unique, multiset, and set decipherability of three-word codes
• Decidability of multiset, set and numerically decipherable directed figure codes
• Note on decipherability of three-word codes

Cited in

(18)

• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Two inequalities implied by unique decipherability
• Coding by minimal linear grammars
• Variants of codes and indecomposable languages
• Note on decipherability of three-word codes
• Full monoids and maximal codes
• Decoding multivariate multiplicity codes on product sets
• Multiset and set decipherable codes
• Unique decipherability in formal languages
• The finest homophonic partition and related code concepts
• Factorization in formal languages
• Multigram codes (Corresp.)
• On unique, multiset, and set decipherability of three-word codes
• Structure of decoders for multivalued encodings
• Coding partitions of regular sets
• On numerically decipherable codes and their homophonic partitions
• Information theory over multisets
• A fast algorithm for the unique decipherability of multivalued encodings

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

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