On codes having no finite completion

Nguyen Huong Lam

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)

  • Volume: 29, Issue: 2, page 145-155
  • ISSN: 0988-3754

How to cite

top

Nguyen Huong Lam. "On codes having no finite completion." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.2 (1995): 145-155. <http://eudml.org/doc/92500>.

@article{NguyenHuongLam1995,
author = {Nguyen Huong Lam},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {maximal code; variable length codes; incompletable codes; binary alphabet},
language = {eng},
number = {2},
pages = {145-155},
publisher = {EDP-Sciences},
title = {On codes having no finite completion},
url = {http://eudml.org/doc/92500},
volume = {29},
year = {1995},
}

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
PB - EDP-Sciences
VL - 29
IS - 2
SP - 145
EP - 155
LA - eng
KW - maximal code; variable length codes; incompletable codes; binary alphabet
UR - http://eudml.org/doc/92500
ER -

References

top
  1. 1. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, New York, 1985. Zbl0587.68066MR797069
  2. 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. 3. C. DE FELICE, Construction of a Family of Finite Maximal Codes, Theoretical Computer Science, 1989, 63, pp. 157-184. Zbl0667.68079MR984315
  4. 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. 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. 6. L. FUCHS, Abelian Groups, Akadémiai kiadó, Budapest, 1958, Pergamon Press, Oxford-London-New York-Paris, 1960. MR111783
  7. 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. 8. G. LALLEMENT, Semigroups and Combinatorial Applications, John Wiley and Sons, New York, 1979, 1969. Zbl0421.20025MR530552
  9. 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. 10. A. RESTIVO, On Codes Having no Finite Completions, Discrete Mathematics, 1977, 17, pp. 309-316. Zbl0357.94011MR498922
  11. 11. A. RESTIVO, S. SALEMI and T. SPORTELLI, Completing Codes, RAIRO Informatique théorique, 1989, 23, pp. 135-147. Zbl0669.94012MR1001722

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.