Binary codes of strongly regular graphs (Q1963158)
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: Binary codes of strongly regular graphs |
scientific article; zbMATH DE number 1392717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary codes of strongly regular graphs |
scientific article; zbMATH DE number 1392717 |
Statements
Binary codes of strongly regular graphs (English)
0 references
24 January 2000
0 references
The binary code of a graph is the linear code generated by the rows of the adjacency matrix of the graph. The authors investigate, with the exception of two parameter sets, the codes from known strongly regular graphs with fewer than 45 vertices. They also consider the codes obtained when the main diagonal of the adjacency matrix is the all-one vector. For the codes, the dimension and the weight enumerator are determined using a computer and tabulated; isomorphic codes are also indicated. Several general results for codes of (various types of) strongly regular graphs are proved.
0 references
adjacency matrix
0 references
code of graph
0 references
linear code
0 references
rank
0 references
regular two-graph
0 references
strongly regular graph
0 references
0.869467556476593
0 references
0.8459853529930115
0 references
0.8319458365440369
0 references
0.8305912613868713
0 references
