Geodesic
Finite completion of comma-free codes. Part 1
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 2, pp. 91-115

Voir la notice de l'article provenant de la source Numdam

This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended to be published in a forthcoming paper.

DOI : 10.1051/ita:2004006
Classification : 68R15, 68S05
Keywords: comma-free code, completion, finite maximal comma-free code 
@article{ITA_2004__38_2_91_0,
     author = {Lam, Nguyen Huong},
     title = {Finite completion of comma-free codes. {Part} 1},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {91--115},
     publisher = {EDP-Sciences},
     volume = {38},
     number = {2},
     year = {2004},
     doi = {10.1051/ita:2004006},
     mrnumber = {2060772},
     zbl = {1058.94009},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2004006/}
}
TY  - JOUR
AU  - Lam, Nguyen Huong
TI  - Finite completion of comma-free codes. Part 1
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2004
SP  - 91
EP  - 115
VL  - 38
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2004006/
DO  - 10.1051/ita:2004006
LA  - en
ID  - ITA_2004__38_2_91_0
ER  - 
%0 Journal Article
%A Lam, Nguyen Huong
%T Finite completion of comma-free codes. Part 1
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2004
%P 91-115
%V 38
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2004006/
%R 10.1051/ita:2004006
%G en
%F ITA_2004__38_2_91_0
Lam, Nguyen Huong. Finite completion of comma-free codes. Part 1. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 2, pp. 91-115. doi: 10.1051/ita:2004006

Cité par Sources :