Maximal circular codes versus maximal codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 35 (2001) no. 4, pp. 351-365
Cet article a éte moissonné depuis la source Numdam
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},
year = {2001},
publisher = {EDP-Sciences},
volume = {35},
number = {4},
mrnumber = {1880804},
zbl = {1005.94014},
language = {en},
url = {http://geodesic.mathdoc.fr/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 SP - 351 EP - 365 VL - 35 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_2001__35_4_351_0/ 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 %U http://geodesic.mathdoc.fr/item/ITA_2001__35_4_351_0/ %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, Tome 35 (2001) no. 4, pp. 351-365. http://geodesic.mathdoc.fr/item/ITA_2001__35_4_351_0/