On codes with finite interpreting delay: a defect theorem
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 34, Issue: 1, page 47-59
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- 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 Theoretical Aspects of Computer Science. Springer, Lectures Notes in Comput. Sci.900 (1995) 640-651.
- J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).
- J. Berstel, D. Perrin, J.F. Perrot and A. Restivo, Sur le théorème du défaut. J. Algebra60 (1979) 169-180.
- V. Bruyère, Maximal codes with bounded deciphering delay. Theoret. Comput. Sci.84 (1991) 53-76.
- S.W. Golomb and B. Gordon, Codes with bounded synchronization delay. Inform. and Control8 (1965) 355-372.
- M. Leconte, Codes sans répétition. Ph.D. Thesis, Université Paris VII (1985).
- A. Restivo, A combinatorial property of codes having finite synchronization delay. Theoret. Comput. Sci.1 (1975) 95-101.
- 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.
- J.C. Spehner, Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre. Semigroup Forum9 (1975) 334-353.