Decompositions of recognizable strong maximal codes (Q685444): Difference between revisions

We study the decompositions of recognizable strong maximal codes. The main results are: (1) Any recognizable strong maximal code \(X\) can be decomposed to a finite number of indecomposable (in the sense of strong codes) recognizable strong maximal codes. This decomposition corresponds to the composition series of the syntactic group of \(X^*\). (2) We propose a special class of recognizable strong maximal codes, the so-called solvable strong codes which is a recognizable strong maximal code \(X\) such that the syntactic group of \(X^*\) is a solvable group. By (1), any solvable strong maximal code can be decomposed to a finite number of indecomposable (in the sense of general codes) strong maximal codes. For the indecomposable strong maximal codes (in the sense of general codes), a structure formula is given.