On multiset decipherable codes (Corresp.)
From MaRDI portal
Publication:3757831
DOI10.1109/TIT.1986.1057217zbMATH Open0619.94019MaRDI QIDQ3757831FDOQ3757831
Authors: Abraham Lempel 
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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)
- Variants of codes and indecomposable languages
- Decoding multivariate multiplicity codes on product sets
- The finest homophonic partition and related code concepts
- Unique decipherability in formal languages
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Information theory over multisets
- Multigram codes (Corresp.)
- Coding by minimal linear grammars
- Note on decipherability of three-word codes
- Full monoids and maximal codes
- Multiset and set decipherable codes
- Coding partitions of regular sets
- On numerically decipherable codes and their homophonic partitions
- Two inequalities implied by unique decipherability
- A fast algorithm for the unique decipherability of multivalued encodings
- Factorization in formal languages
- On unique, multiset, and set decipherability of three-word codes
- Structure of decoders for 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)
