Completing solid codes to maximal comma-free codes (Q1409802)

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.