Decipherability of codes
Decipherability of codes based on varieties of monoids is considered. A code \(C\) is said to be decipherable in a monoid \(M\) if each map \(f: C\to M\) extends to the homomorphism \(f^*: C^*\to M\). Some classes of codes such as uniquely decipherable codes, multiset decipherable codes [\textit{A. Lempel}, IEEE Trans. Inf. Theory 32, 714-716 (1986; Zbl 0619.94019)] as well as set decipherable codes, defined in this paper, correspond to suitable varieties of monoids. It has been shown that a basis for the variety of monoids is determined by the simplified domino graph of the corresponding code. See \textit{T. Head} and \textit{A. Weber}, same journal 41, 291-297 (1995; Zbl 0823.94020) for the connections to the notion of domino graph.
- Note on decipherability of three-word codes
- Coding by minimal linear grammars
- Unique decipherability in formal languages
- On numerically decipherable codes and their homophonic partitions
- Full monoids and maximal codes
- Coding partitions of regular sets
- On Unique Decodability
- scientific article; zbMATH DE number 3928874 (Why is no real title available?)
- Decoding the Golay codes
- WERE THE JAPANESE ARMY CODES SECURE?
- One-relation languages and code generators
- Unique decipherability in the additive monoid of sets of numbers
- Decoding Gentzen's Notation
- Code Reverse Engineering Problem for Identification Codes
- STACS 2005
- Multiset and set decipherable codes
- Factorizations and monoids
- Codes, orderings, and partial words
This page was built for publication: Decipherability of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304888)
