On codes having no finite completion
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1996)
- Volume: 30, Issue: 6, page 483-493
- ISSN: 0988-3754
Access Full Article
topHow to cite
topNguyen Huong Lam. "On codes having no finite completion." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.6 (1996): 483-493. <http://eudml.org/doc/92547>.
@article{NguyenHuongLam1996,
author = {Nguyen Huong Lam},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {maximal code},
language = {eng},
number = {6},
pages = {483-493},
publisher = {EDP-Sciences},
title = {On codes having no finite completion},
url = {http://eudml.org/doc/92547},
volume = {30},
year = {1996},
}
TY - JOUR
AU - Nguyen Huong Lam
TI - On codes having no finite completion
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1996
PB - EDP-Sciences
VL - 30
IS - 6
SP - 483
EP - 493
LA - eng
KW - maximal code
UR - http://eudml.org/doc/92547
ER -
References
top- 1. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, NewYork, 1985. Zbl0587.68066MR797069
- 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. Zbl0722.94006MR1078707
- 3. C. DE FELICE, Construction of a Family of Finite Maximal Codes, Theoretical Computer Science, 1989, 63, pp. 157-184. Zbl0667.68079MR984315
- 4. C. DE FELICE and A. RESTIVO, Some Results on Finite Maximal Codes, RAIRO Informatique théorique, 1985, 19, pp. 383-403. Zbl0578.68062MR827484
- 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. Zbl0609.68053MR849968
- 6. L. FUCHS, Abelian Groups, Akadémiai kiadó, Budapest, 1958, Pergamon Press, Oxford-London-New York-Paris, 1960. MR111783
- 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. Zbl0015.38601JFM63.0044.03
- 8. G. LALLEMENT, Semigroups and Combinatorial Applications, John Wiley and Sons, New York, 1979, 1969. Zbl0421.20025MR530552
- 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). Zbl0154.00703MR210594
- 10. A. RESTIVO, On Codes Having No Finite Completions, Discrete Mathematics, 1977, 17, pp. 309-316. Zbl0357.94011MR498922
- 11. A. RESTIVO, S. SALEMI and T. SPORTELLI, Completing Codes, RAIRO Informatique théorique, 1989, 23, pp. 135-147. Zbl0669.94012MR1001722
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.