On codes with finite interpreting delay: a defect theorem
From MaRDI portal
Publication:4494481
DOI10.1051/ita:2000106zbMath0978.94047MaRDI QIDQ4494481
Publication date: 31 January 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2000__34_1_47_0/
prefix codes; circular codes; defect theorem; codes with finite synchronization delay; codes with finite deciphering delay; codes with finite interpreting delay
Related Items
Maximal circular codesversusmaximal codes, On maximal codes with a finite interpreting delay., Identification of circular codes in bacterial genomes and their use in a factorization method for retrieving the reading frames of genes
Cites Work
- Unnamed Item
- Unnamed Item
- Sur le théorème du defaut
- Maximal codes with bounded deciphering delay
- Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
- A combinatorial property of codes having finite synchronization delay
- A possible code in the genetic code
- Codes with bounded synchronization delay