@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}, pages = {47--59}, publisher = {EDP-Sciences}, volume = {34}, number = {1}, year = {2000}, mrnumber = {1771129}, zbl = {0978.94047}, language = {en}, url = {http://archive.numdam.org/item/ITA_2000__34_1_47_0/} }
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 SP - 47 EP - 59 VL - 34 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_2000__34_1_47_0/ LA - en ID - ITA_2000__34_1_47_0 ER -
%0 Journal Article %A Guesnet, Yannick %T On codes with finite interpreting delay : a defect theorem %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2000 %P 47-59 %V 34 %N 1 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_2000__34_1_47_0/ %G en %F 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, Volume 34 (2000) no. 1, pp. 47-59. http://archive.numdam.org/item/ITA_2000__34_1_47_0/
[1] 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
and ,[2] Theory of Codes. Academic Press (1985). | MR | Zbl
and ,[3] Sur le théorème du défaut. J. Algebra 60 (1979) 169-180. | MR | Zbl
, , and ,[4] Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84 (1991) 53-76. | Zbl
,[5] Codes with bounded synchronization delay. Inform. and Control 8 (1965) 355-372. | MR | Zbl
and ,[6] Codes sans répétition. Ph. D. Thesis, Université Paris VII (1985).
,[7] A combinatorial property of codes having finite synchronization delay, Theoret. Comput Sci. 1 (1975) 95-101. | MR | Zbl
,[8] A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104-108.
and ,[9] Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre. Semigroup Forum 9 (1975) 334-353. | MR | Zbl
,