A hierarchy for circular codes
    
    
  
  
  
      
      
      
        
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 4, pp. 717-728
    
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Numdam
We first prove an extremal property of the infinite Fibonacci word : the family of the palindromic prefixes of 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.
                
                  
                  
                    
                    
                  
                    
                  
                
                
                
                
                  
  
    
      DOI : 
        
          10.1051/ita:2008002
        
        
    
  
                
                
                
                
                   
                      
                  
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
              
              
                  
                    
                    
                      
   Classification : 
68R15, 94A45
Keywords: theory of codes, comma-free codes, circular codes
                    
                    
                    
                  
                
                
                Keywords: theory of codes, comma-free codes, circular codes
@article{ITA_2008__42_4_717_0,
     author = {Pirillo, Giuseppe},
     title = {A hierarchy for circular codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {717--728},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {4},
     year = {2008},
     doi = {10.1051/ita:2008002},
     mrnumber = {2458703},
     zbl = {1155.68069},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2008002/}
}
                      
                      
                    TY - JOUR AU - Pirillo, Giuseppe TI - A hierarchy for circular codes JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2008 SP - 717 EP - 728 VL - 42 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2008002/ DO - 10.1051/ita:2008002 LA - en ID - ITA_2008__42_4_717_0 ER -
%0 Journal Article %A Pirillo, Giuseppe %T A hierarchy for circular codes %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2008 %P 717-728 %V 42 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2008002/ %R 10.1051/ita:2008002 %G en %F ITA_2008__42_4_717_0
Pirillo, Giuseppe. A hierarchy for circular codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 4, pp. 717-728. doi: 10.1051/ita:2008002
Cité par Sources :
 
    