Completing Solid Codes to Maximal CommaFree Codes
Nguyen Huong Lam
Abstract. We give a partial answer to
the following problem: Is every finite commafree code is completed to a finite
maximal commafree code? Namely, we show that every finite solid code could
be explicitly embedded in a finite maximal commafree code. The construction
relies on an investigation into some structural aspects of maximal solid codes
that has an independent interest.
