Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs (Q456889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs |
scientific article; zbMATH DE number 6094167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs |
scientific article; zbMATH DE number 6094167 |
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
0 references
0.8459853529930115
0 references
0.8354518413543701
0 references
0.8319606781005859
0 references
0.8314757347106934
0 references
0.8295948505401611
0 references
