On codes with finite interpreting delay : a defect theorem

Yannick Guesnet

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

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

How to cite

top

Guesnet, Yannick. "On codes with finite interpreting delay : a defect theorem." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.1 (2000): 47-59. <http://eudml.org/doc/92623>.

@article{Guesnet2000,
author = {Guesnet, Yannick},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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},
number = {1},
pages = {47-59},
publisher = {EDP-Sciences},
title = {On codes with finite interpreting delay : a defect theorem},
url = {http://eudml.org/doc/92623},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Guesnet, Yannick
TI - On codes with finite interpreting delay : a defect theorem
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 1
SP - 47
EP - 59
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/92623
ER -

References

top
  1. [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. MR1371384
  2. [2] J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985). Zbl0587.68066MR797069
  3. [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. Zbl0421.20027MR549103
  4. [4] V. Bruyère, Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84 (1991) 53-76. Zbl0737.68049
  5. [5] S. W. Golomb and B. Gordon, Codes with bounded synchronization delay. Inform. and Control 8 (1965) 355-372. Zbl0202.50404MR180413
  6. [6] M. Leconte, Codes sans répétition. Ph. D. Thesis, Université Paris VII (1985). 
  7. [7] A. Restivo, A combinatorial property of codes having finite synchronization delay, Theoret. Comput Sci. 1 (1975) 95-101. Zbl0381.94017MR414224
  8. [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. [9] J. C. Spehner, Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre. Semigroup Forum 9 (1975) 334-353. Zbl0298.20046MR387448

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.