Decipherability of codes (Q1304888)

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.