论文信息 - On Codes Having no Finite Completion

On Codes Having no Finite Completion

On presente une technique pour construire une famille de codes finiment incompletables contenant le mot a n pour tout n ≥ 5 et n ≥ 6 sur un alphabet {a,b}. Cette construction est basee sur la notion de paires nonambigues incompletables en une factorisation de Z n

Nguyen Huong Lam

[1] J. Berstel,et al. Theory of codes , 1985 .

[2] Al. A. Markov. Example of an independent system of words which cannot be included in a finite complete system , 1967 .

[3] Antonio Restivo,et al. On codes having no finite completions , 1977, Discret. Math..

[4] Andrzej Ehrenfeucht,et al. Each Regular Code Is Included in A Maximal Regular Code , 1986, RAIRO Theor. Informatics Appl..

[5] G. Lallement. Semigroups and combinatorial applications , 1979 .

[6] Clelia de Felice. Construction of a Family of Finite Maximal Codes , 1989, Theor. Comput. Sci..

[7] Véronique Bruyère,et al. On Completion of Codes with Finite Deciphering Delay , 1990, Eur. J. Comb..

[8] Antonio Restivo,et al. Some Results On Finite Maximal Codes , 1985, RAIRO Theor. Informatics Appl..