On codes with finite interpreting delay : a defect theorem
Guesnet, Yannick
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000), p. 47-59 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_2000__34_1_47_0,
     author = {Guesnet, Yannick},
     title = {On codes with finite interpreting delay : a defect theorem},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {34},
     year = {2000},
     pages = {47-59},
     mrnumber = {1771129},
     zbl = {0978.94047},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2000__34_1_47_0}
}

Guesnet, Yannick. On codes with finite interpreting delay : a defect theorem. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) pp. 47-59. http://gdmltest.u-ga.fr/item/ITA_2000__34_1_47_0/

[1] D. Arques and C. J. Michel, A possible code in the genetic code, edited by E.W. Mayr and C. Puech, 12th Annual Symposium on Theoreticat Aspects of Computer Science. Springer, Lectures Notes in Comput. Sci. 900 (1995) 640-651. | MR 1371384

[2] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985). | MR 797069 | Zbl 0587.68066

[3] J. Berstel, D. Perrin, J. F. Perrot and A. Restivo, Sur le théorème du défaut. J. Algebra 60 (1979) 169-180. | MR 549103 | Zbl 0421.20027

[4] V. Bruyère, Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84 (1991) 53-76. | Zbl 0737.68049

[5] S. W. Golomb and B. Gordon, Codes with bounded synchronization delay. Inform. and Control 8 (1965) 355-372. | MR 180413 | Zbl 0202.50404

[6] M. Leconte, Codes sans répétition. Ph. D. Thesis, Université Paris VII (1985).

[7] A. Restivo, A combinatorial property of codes having finite synchronization delay, Theoret. Comput Sci. 1 (1975) 95-101. | MR 414224 | Zbl 0381.94017

[8] A. A. Sardinas and C. Patterson, A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104-108.

[9] J. C. Spehner, Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre. Semigroup Forum 9 (1975) 334-353. | MR 387448 | Zbl 0298.20046