Binary codes of strongly regular graphs
From MaRDI portal
Publication:1963158
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.
Recommendations
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- scientific article; zbMATH DE number 6497232
- Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
- Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
- Codes from orbit matrices of strongly regular graphs
Cited in
(54)- Permutation decoding for the binary codes from triangular graphs.
- Hypergraphical codes arising from binary trades
- \(LCD\) codes from adjacency matrices of graphs
- What is odd about binary Parseval frames?
- Switched graphs of some strongly regular graphs related to the symplectic graph
- On generalized MacDonald codes
- On the nullspace of arc-transitive graphs over finite fields
- Binary codes from graphs on triples
- The Hermitian two-graph and its code
- The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- Hamming graphs and special LCD codes
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- A useful tool for constructing linear codes
- Quadratic residue codes, rank three groups and PBIBDs
- Three-weight codes over rings and strongly walk regular graphs
- Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
- Ternary codes from some reflexive uniform subset graphs
- On the codes related to the Higman-Sims graph
- Graph switching, 2-ranks, and graphical Hadamard matrices
- Hulls of codes from incidence matrices of connected regular graphs
- Additive complementary dual codes over \(\mathbb{F}_4\)
- On strongly walk regular graphs, triple sum sets and their codes
- Codes from multipartite graphs and minimal permutation decoding sets
- Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
- Switched symplectic graphs and their 2-ranks
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- A characterization of graphs by codes from their incidence matrices
- scientific article; zbMATH DE number 9818 (Why is no real title available?)
- Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
- On the binary codes with parameters of triply-shortened 1-perfect codes
- Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
- Linear closures of finite geometries
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- Vertex codes of graphs
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- scientific article; zbMATH DE number 975345 (Why is no real title available?)
- Directed strongly regular graphs and their codes
- Properties and parameters of codes from line graphs of circulant graphs
- Isodual and self-dual codes from graphs
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- On the binary codes of length 552 which admit the simple group Co3 as a transitive permutation group
- Codes from lattice and related graphs, and permutation decoding
- scientific article; zbMATH DE number 7758721 (Why is no real title available?)
- Linear ternary codes of strongly regular signed graphs
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Special \textit{LCD} codes from products of graphs
- Codes and designs from triangular graphs and their line graphs
- Codes from strongly regular \(( \alpha , \beta )\)-reguli
- The adjacency codes of the first yellow graphs
- Binary representations of regular graphs
- Primitive rank 3 groups, binary codes, and 3-designs
- On the dual binary codes of the triangular graphs
- Permutation decoding for binary codes from lattice graphs
This page was built for publication: Binary codes of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963158)
