Monoids and Maximal Codes

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maximal UD code.

[1]  Tom Head,et al.  Deciding multiset decipherability , 1995, IEEE Trans. Inf. Theory.

[2]  Antonio Restivo,et al.  Coding Partitions , 2007, Discret. Math. Theor. Comput. Sci..

[3]  Antonio Restivo,et al.  Varieties of Codes and Kraft Inequality , 2006, Theory of Computing Systems.

[4]  Fernando Guzmán,et al.  Decipherability of codes , 1999 .

[5]  Riccardo Leonardi,et al.  Non prefix-free codes for constrained sequences , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[6]  Tom Head,et al.  The finest homophonic partition and related code concepts , 1994, IEEE Trans. Inf. Theory.

[7]  Dominique Perrin,et al.  Codes and Automata (Encyclopedia of Mathematics and its Applications) , 2009 .

[8]  Antonio Restivo.  A note on multiset decipherable codes , 1989, IEEE Trans. Inf. Theory.

[9]  Antonio Restivo,et al.  Varieties of Codes and Kraft Inequality , 2005, STACS.

[10]  Antonio Restivo,et al.  Coding Partitions of Regular Sets , 2009, Int. J. Algebra Comput..

[11]  Güney Gönenç.  Unique decipherability of codes with constraints with application to syllabification of Turkish words , 1973, COLING 1973.

[12]  Guney Gonenc.  Unique Decipherability of Codes with Constraints with Application to Syllabification of Turkish Words , 1973, COLING.

[13]  Antonio Restivo,et al.  Codes and Automata , 1987, Formal Properties of Finite Automata and Applications.

[14]  Abraham Lempel.  On multiset decipherable codes , 1986, IEEE Trans. Inf. Theory.

[15]  Andrzej Ehrenfeucht,et al.  Each Regular Code Is Included in A Maximal Regular Code , 1986, RAIRO Theor. Informatics Appl..