On maximal codes with a finite interpreting delay.

DOI10.1016/S0304-3975(00)00439-4zbMath1050.68040MaRDI QIDQ1605334

Yannick Guesnet

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Maximal codesEmbedding MethodComplete setsInterpreting delay

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Maximal circular codesversusmaximal codes ⋮ On maximal synchronous codes. ⋮ Completing circular codes in regular submonoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of recognizable bifix codes
• On completion of codes with finite deciphering delay
• On some properties of very pure codes
• Maximal codes with bounded deciphering delay
• On codes having no finite completions
• On maximal codes with bounded synchronization delay
• Maximal bifix codes
• Each regular code is included in a maximal regular code
• On codes with finite interpreting delay: a defect theorem
• On a question concerning certain free submonoids

This page was built for publication: On maximal codes with a finite interpreting delay.