Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs (Q456889): Difference between revisions
From MaRDI portal
Latest revision as of 19:18, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs |
scientific article |
Statements
Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs (English)
0 references
16 October 2012
0 references
The paper describes the computational results of linear ternary codes spanned by adjacency matrices of strongly regular graphs with parameters (45, 12, 3, 3), as well as codes having as generator matrices orbit matrices of such graphs with respect to a given automorphism group. Several optimal or nearly optimal codes are found. Some of the codes are shown to admit majority-logic decoding.
0 references
linear ternary code
0 references
combinatorial design
0 references
strongly regular graph
0 references
0 references
