@article{ITA_1995__29_2_145_0, author = {Nguyen Huong Lam}, title = {On codes having no finite completion}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {145--155}, publisher = {EDP-Sciences}, volume = {29}, number = {2}, year = {1995}, mrnumber = {1329280}, zbl = {0819.94019}, language = {en}, url = {http://www.numdam.org/item/ITA_1995__29_2_145_0/} }
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 - 1995 SP - 145 EP - 155 VL - 29 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1995__29_2_145_0/ LA - en ID - ITA_1995__29_2_145_0 ER -
Nguyen Huong Lam. On codes having no finite completion. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 2, pp. 145-155. http://www.numdam.org/item/ITA_1995__29_2_145_0/
1. Theory of Codes, Academic Press, New York, 1985. | MR | Zbl
and ,2. On Completion of Codes with Finite Deciphering Delay, European Journal of Combinatorics, 1990, 16, pp. 513-521. | MR | Zbl
, and ,3. Construction of a Family of Finite Maximal Codes, Theoretical Computer Science, 1989, 63, pp. 157-184. | MR | Zbl
,4. Some Results on Finite Maximal Codes, RAIRO Informatique théorique, 1985, 19, pp. 383-403. | Numdam | MR | Zbl
and ,5. Each Regular Code Is Included in a Regular Maximal Code, Rairo Informatique théorique, 1986, 16, pp. 89-96. | Numdam | MR | Zbl
and ,6. Abelian Groups, Akadémiai kiadó, Budapest, 1958, Pergamon Press, Oxford-London-New York-Paris, 1960. | MR
,7. Sur une propriété des polynômes de la division du cercle, C.R. Acad. Sci. Paris, 1937, 240, pp. 297-299. | JFM | Zbl
and ,8. Semigroups and Combinatorial Applications, John Wiley and Sons, New York, 1979, 1969. | MR | Zbl
,9. 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 | Zbl
,10. On Codes Having no Finite Completions, Discrete Mathematics, 1977, 17, pp. 309-316. | MR | Zbl
,11. Completing Codes, RAIRO Informatique théorique, 1989, 23, pp. 135-147. | Numdam | MR | Zbl
, and ,