Decompositions of recognizable strong maximal codes (Q685444): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:26, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decompositions of recognizable strong maximal codes |
scientific article |
Statements
Decompositions of recognizable strong maximal codes (English)
0 references
9 January 1994
0 references
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.
0 references
decomposition of codes
0 references
strong codes
0 references
recognizable codes
0 references