We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
FULL MONOIDS AND MAXIMAL CODES.
- Authors
BURDERI, FABIO
- Abstract
In recent years codes that are not Uniquely Decipherable ( UD) were 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 free 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 set. 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. Finally we generalize some properties of UD codes.
- Subjects
MONOIDS; MAXIMAL functions; CIPHERS; AMBIGUITY; FREE products (Group theory); CODING theory; PARTITIONS (Mathematics)
- Publication
International Journal of Foundations of Computer Science, 2012, Vol 23, Issue 8, p1677
- ISSN
0129-0541
- Publication type
Article
- DOI
10.1142/S0129054112400692