A hierarchy for circular codes
From MaRDI portal
Publication:3537493
DOI10.1051/ita:2008002zbMath1155.68069MaRDI QIDQ3537493
Publication date: 7 November 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92899
68R15: Combinatorics on words
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A45: Prefix, length-variable, comma-free codes
Related Items
Maximal dinucleotide and trinucleotide circular codes, Dinucleotide circular codes, A classification of 20-trinucleotide circular codes, Strong trinucleotide circular codes, A relation between trinucleotide comma-free codes and trinucleotide circular codes, A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes
Cites Work
- On some factorizations of infinite words by elements of codes
- Varieties of comma-free codes
- A combinatorial property of the Fibonacci words
- Infinite words and biprefix codes
- Palindromes in the Fibonacci word
- Fibonacci numbers and words
- Sturmian words: structure, combinatorics, and their arithmetics
- On cube-free \(\omega\)-words generated by binary morphisms
- Repetitions in the Fibonacci infinite word
- Fast Pattern Matching in Strings
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item