Maximal circular codes versus maximal codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 35 (2001) no. 4, pp. 351-365.

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

@article{ITA_2001__35_4_351_0,
     author = {Guesnet, Yannick},
     title = {Maximal circular codes versus maximal codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {351--365},
     publisher = {EDP-Sciences},
     volume = {35},
     number = {4},
     year = {2001},
     zbl = {1005.94014},
     mrnumber = {1880804},
     language = {en},
     url = {http://www.numdam.org/item/ITA_2001__35_4_351_0/}
}
TY  - JOUR
AU  - Guesnet, Yannick
TI  - Maximal circular codes versus maximal codes
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2001
DA  - 2001///
SP  - 351
EP  - 365
VL  - 35
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_2001__35_4_351_0/
UR  - https://zbmath.org/?q=an%3A1005.94014
UR  - https://www.ams.org/mathscinet-getitem?mr=1880804
LA  - en
ID  - ITA_2001__35_4_351_0
ER  - 
%0 Journal Article
%A Guesnet, Yannick
%T Maximal circular codes versus maximal codes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2001
%P 351-365
%V 35
%N 4
%I EDP-Sciences
%G en
%F ITA_2001__35_4_351_0
Guesnet, Yannick. Maximal circular codes versus maximal codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 35 (2001) no. 4, pp. 351-365. http://www.numdam.org/item/ITA_2001__35_4_351_0/

[1] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985). | MR | Zbl

[2] V. Bruyère, Codes, Dissertation présentée pour l'obtention de grade légal de docteur en sciences. Université de Mons-Hainaut (1991).

[3] V. Bruyère, On maximal codes with bounded synchronization delay. Theoret. Comput. Sci., 204 (1998) 11-28. | MR | Zbl

[4] A. De Luca and A. Restivo, On some properties of very pure codes. Theoret. Comput. Sci., 10 (1980) 157-170. | MR | Zbl

[5] Y. Guesnet, On codes with finite interpreting delay: A defect theorem. Theoret. Informatics Appl., 34 (2000) 47-59. | Numdam | MR | Zbl

[6] Y. Guesnet, Codes et interprétations, Thèse de doctorat. Université de Rouen (2001). | MR

[7] Y. Guesnet, On maximal codes with finite interpreting delay. Theoret. Comput. Sci., (to appear). | Zbl

[8] M.P. Schützenberger, Une théorie algébrique du codage, in: Séminaire Dubreil-Pisot 1955-56 Institut H. Poincaré (1956), Exposé n 15. | Numdam | MR