Completing solid codes to maximal comma-free codes
From MaRDI portal
The main result of the paper is the solution of the completion problem for finite solid codes. It has been shown that a finite solid code, considered as a comma-free code, is contained in a finite maximal comma-free code. But the general problem: Can every finite comma-free code be completed to a finite maximal comma-free code? is still open.
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)
