Abstract | ||
---|---|---|
We are dealing with the zigzag codes in connection with monoid morphisms and free group morphisms. The injectivity of free group morphisms plays here the role of that of free monoid morphisms for ordinary codes. Subsets of free group words describing behaviours of zigzag factorizations allow us to characterize zigzag codes in different ways. Every two-element code is a zigzag code. The free monoid morphisms preserving the property of being a zigzag code are exactly the coding morphisms for the biprefix codes. |
Year | Venue | Field |
---|---|---|
1992 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | Combinatorics,Free monoid,Zigzag,Mathematics,Morphism,Zigzag code |
DocType | Volume | Issue |
Journal | 26 | 6 |
ISSN | Citations | PageRank |
0988-3754 | 6 | 0.82 |
References | Authors | |
2 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Do Long Van | 1 | 42 | 11.45 |
Bertrand Le Saëc | 2 | 106 | 16.83 |
Igor Litovsky | 3 | 151 | 17.74 |