On codes with finite interpreting delay: a defect theorem

Yannick Guesnet

RAIRO - Theoretical Informatics and Applications (2010)

  • Volume: 34, Issue: 1, page 47-59
  • ISSN: 0988-3754

Abstract

top
We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem.

How to cite

top

Guesnet, Yannick. "On codes with finite interpreting delay: a defect theorem." RAIRO - Theoretical Informatics and Applications 34.1 (2010): 47-59. <http://eudml.org/doc/221952>.

@article{Guesnet2010,
abstract = { We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem. },
author = {Guesnet, Yannick},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {defect theorem; codes with finite interpreting delay; codes with finite deciphering delay; codes with finite synchronization delay; prefix codes; circular codes},
language = {eng},
month = {3},
number = {1},
pages = {47-59},
publisher = {EDP Sciences},
title = {On codes with finite interpreting delay: a defect theorem},
url = {http://eudml.org/doc/221952},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Guesnet, Yannick
TI - On codes with finite interpreting delay: a defect theorem
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 1
SP - 47
EP - 59
AB - We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem.
LA - eng
KW - defect theorem; codes with finite interpreting delay; codes with finite deciphering delay; codes with finite synchronization delay; prefix codes; circular codes
UR - http://eudml.org/doc/221952
ER -

References

top
  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 Theoretical Aspects of Computer Science. Springer, Lectures Notes in Comput. Sci.900 (1995) 640-651.  
  2. J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).  
  3. J. Berstel, D. Perrin, J.F. Perrot and A. Restivo, Sur le théorème du défaut. J. Algebra60 (1979) 169-180.  
  4. V. Bruyère, Maximal codes with bounded deciphering delay. Theoret. Comput. Sci.84 (1991) 53-76.  
  5. S.W. Golomb and B. Gordon, Codes with bounded synchronization delay. Inform. and Control8 (1965) 355-372.  
  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.  
  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 Forum9 (1975) 334-353.  

NotesEmbed ?

top

You must be logged in to post comments.