Binary codes of strongly regular graphs (Q1963158): Difference between revisions

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.