A note on codes having no finite completions
From MaRDI portal
Publication:1350354
DOI10.1016/0020-0190(95)00102-IzbMath1023.68572MaRDI QIDQ1350354
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
formal languages; combinatorics on words; \(n\)-Bayonet code; bayonet code; code having no finite completions
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
ON A PROPERTY OF THE FACTORIZING CODES, FINITE COMPLETIONS VIA FACTORIZING CODES, An application of Hajós factorizations to variable-length codes, On factorizing codes: Structural properties and related decision problems, On a complete set of operations for factorizing codes
Cites Work