A three-word code which is not prefix-suffix composed

DOI10.1016/0304-3975(95)00139-5zbMath0874.68169OpenAlexW2076024367MaRDI QIDQ671357

Denis Derencourt

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00139-5

zbMATH Keywords

\(n\)-word codecodes having finite completioncodes having no finite completionfinite \(p\)-\(s\)-composed codesfinite prefix-suffix composed code

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (5)

A first step in characterizing three-element codes ⋮ On the proportion of prefix codes in the set of three-element codes ⋮ The second step in characterizing a three-word code ⋮ An application of Hajós factorizations to variable-length codes ⋮ On a complete set of operations for factorizing codes

Cites Work

• Unnamed Item
• Unnamed Item
• Sur le théorème du defaut
• On codes having no finite completions
• Completing codes
• Une famille remarquable de codes indecomposables

This page was built for publication: A three-word code which is not prefix-suffix composed