Some combinatorial properties of solid codes

Solid codes can be used in information transmission over a noisy channel because they have remarkable synchronization and error-detecting capabilities in the presence of noise. In this paper, we focus on combinatoric properties of solid codes. We begin by characterizing solid codes by means of infix codes and unbordered words. Then, we discuss the decomposition of solid codes (in particular, the maximal solid codes). And finally, we investigate several properties of the products of the solid codes and some other kinds of codes. Our results given in this paper significantly enrich the theory of solid codes.