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