Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-09T23:32:32.711Z Has data issue: false hasContentIssue false
  • English
  • Français

On codes with finite interpreting delay: a defect theorem

Published online by Cambridge University Press:  15 April 2002

Yannick Guesnet
Yannick Guesnet*
Affiliation:
LIFAR, Université de Rouen, Place Émile Blondel, 76821 Mont-Saint-Aignan, France; (Yannick.Guesnet@dir.univ-rouen.fr)
Get access

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.

Keywords

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 1 , January 2000 , pp. 47 - 59
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arques, D. and Michel, C.J., 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. CrossRef
J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).
Berstel, J., Perrin, D., Perrot, J.F. and Restivo, A., Sur le théorème du défaut. J. Algebra 60 (1979) 169-180. CrossRef
Bruyère, V., Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84 (1991) 53-76. CrossRef
Golomb, S.W. and Gordon, B., Codes with bounded synchronization delay. Inform. and Control 8 (1965) 355-372. CrossRef
M. Leconte, Codes sans répétition. Ph.D. Thesis, Université Paris VII (1985).
Restivo, A., A combinatorial property of codes having finite synchronization delay. Theoret. Comput. Sci. 1 (1975) 95-101. CrossRef
Sardinas, A.A. and Patterson, C., A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104-108.
Spehner, J.C., Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre. Semigroup Forum 9 (1975) 334-353. CrossRef