Decompositions of recognizable strong maximal codes

AbstractIn this paper, we study the decompositions of recognizable strong maximal codes and obtain the following results: Every recognizable strong maximal code is a composition of a finite number of indecomposable (in the sense of strong codes) recognizable strong maximal codes. In particular, every solvable strong code is a composition of a finite number of indecomposable (in the sense of general codes) strong maximal codes and, for the latter, a structure formula is given