Completing solid codes to maximal comma-free codes

MaRDI QIDQ1409802zbMATH OpenFDO

Authors Nguyen Huong Lam

Publication date 22 October 2003

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Comma-free codescompletion problemDNA structuresmaximal codessolid codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• On maximal comma-free codes (Corresp.)
• scientific article; zbMATH DE number 1948513
• Finite Completion of comma-free codes Part 1
• Finite Completion of comma-free codes Part 2
• Some properties of maximal comma-free codes
• scientific article; zbMATH DE number 4092795
• FINITE COMPLETIONS VIA FACTORIZING CODES
• scientific article; zbMATH DE number 3414188
• Compositions of maximal codes
• Some combinatorial properties of solid codes

Cited in

(9)

• Completing comma-free codes
• Maximal solid codes
• Combinatorial problems motivated by comma‐free codes
• Finite Completion of comma-free codes Part 1
• Finite Completion of comma-free codes Part 2
• Finite maximal solid codes
• Three-word codes \(\{a,aba,u\}\) having a finite completion
• Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
• Completing codes in a sofic shift

This page was built for publication: Completing solid codes to maximal comma-free codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1409802)