| Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 4, October-December 2008
Fibonacci words
|
|
|---|---|---|
| Page(s) | 717 - 728 | |
| Section | Topical issue: Fibonacci Words | |
| DOI | https://doi.org/10.1051/ita:2008002 | |
| Published online | 22 January 2008 | |
A hierarchy for circular codes
1
IASI CNR, Viale Morgagni 67/A, 50134 Firenze, Italy; pirillo@math.unifi.it
2
Université de Marne-la-Vallée 5, boulevard Descartes Champs sur Marne
77454 Marne-la-Vallée Cedex 2, France. Bigollo (Leonardo Pisano).
Received:
26
January
2007
Accepted:
22
November
2007
We first prove an extremal property of the infinite Fibonacci* word f: the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
Mathematics Subject Classification: 68R15 / 94A45
Key words: Theory of codes / comma-free codes / circular codes.
© EDP Sciences, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.