On codes having no finite completion
Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996), p. 483-493 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1996-01-01
@article{ITA_1996__30_6_483_0,
     author = {Nguyen Huong Lam},
     title = {On codes having no finite completion},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {30},
     year = {1996},
     pages = {483-493},
     mrnumber = {1454825},
     zbl = {0877.68012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1996__30_6_483_0}
}

Nguyen Huong Lam. On codes having no finite completion. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) pp. 483-493. http://gdmltest.u-ga.fr/item/ITA_1996__30_6_483_0/

1. J. Berstel and D. Perrin, Theory of Codes, Academic Press, NewYork, 1985. | MR 797069 | Zbl 0587.68066

2. V. Bruyère, Limin Wang and Liang Zhang, On Completion of Codes with Finite Deciphering Delay, European Journal of Combinatorics, 1990, 16, pp. 513-521. | MR 1078707 | Zbl 0722.94006

3. C. De Felice, Construction of a Family of Finite Maximal Codes, Theoretical Computer Science, 1989, 63, pp. 157-184. | MR 984315 | Zbl 0667.68079

4. C. De Felice and A. Restivo, Some Results on Finite Maximal Codes, RAIRO Informatique théorique, 1985, 19, pp. 383-403. | Numdam | MR 827484 | Zbl 0578.68062

5. A. Ehrenfeucht and G. Rozenberg, Each Regular Code Is Included in a Regular Maximal Code, RAIRO Informatique théorique, 1986, 16, pp. 89-96. | Numdam | MR 849968 | Zbl 0609.68053

6. L. Fuchs, Abelian Groups, Akadémiai kiadó, Budapest, 1958, Pergamon Press, Oxford-London-New York-Paris, 1960. | MR 111783

7. M. Krasner and B. Ranulac, Sur une propriété des polynômes de la division du cercle, C.R. Acad. Sci. Paris, 1937, 240, pp. 297-299. | JFM 63.0044.03 | Zbl 0015.38601

8. G. Lallement, Semigroups and Combinatorial Applications, John Wiley and Sons, New York, 1979, 1969. | MR 530552 | Zbl 0421.20025

9. Al A. Markov, An Example of Independent System of Words Which Cannot Be Included into a Finite Complete System, Matematicheskie Zametki, 1967, 1, No. 1, pp, 87-90 (in Russian). | MR 210594 | Zbl 0154.00703

10. A. Restivo, On Codes Having No Finite Completions, Discrete Mathematics, 1977, 17, pp. 309-316. | MR 498922 | Zbl 0357.94011

11. A. Restivo, S. Salemi and T. Sportelli, Completing Codes, RAIRO Informatique théorique, 1989, 23, pp. 135-147. | Numdam | MR 1001722 | Zbl 0669.94012