A note on codes having no finite completions

DOI10.1016/0020-0190(95)00102-IzbMath1023.68572MaRDI QIDQ1350354

Nguyen Huong Lam

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

formal languagescombinatorics on words\(n\)-Bayonet codebayonet codecode having no finite completions

Mathematics Subject Classification ID

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

Related Items (5)

On factorizing codes: Structural properties and related decision problems ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ An application of Hajós factorizations to variable-length codes ⋮ On a complete set of operations for factorizing codes ⋮ ON A PROPERTY OF THE FACTORIZING CODES

Cites Work

• On codes having no finite completions
• Completing codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on codes having no finite completions