Binary codes of strongly regular graphs
From MaRDI portal
Publication:1963158
DOI10.1023/A:1026479210284zbMath0938.05062OpenAlexW1535329300MaRDI QIDQ1963158
Willem H. Haemers, Jeroen M. van Rijckevorsel, René Peeters
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026479210284
Related Items (33)
On the binary codes of length 552 which admit the simple group Co3 as a transitive permutation group ⋮ Switched symplectic graphs and their 2-ranks ⋮ \(LCD\) codes from adjacency matrices of graphs ⋮ On the dual binary codes of the triangular graphs ⋮ Unnamed Item ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ What is odd about binary Parseval frames? ⋮ Additive complementary dual codes over \(\mathbb{F}_4\) ⋮ Linear ternary codes of strongly regular signed graphs ⋮ Binary codes of some strongly regular subgraphs of the McLaughlin graph ⋮ 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 ⋮ Special \textit{LCD} codes from products of graphs ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1) ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs ⋮ Unnamed Item ⋮ Permutation decoding for the binary codes from triangular graphs. ⋮ Codes and designs from triangular graphs and their line graphs ⋮ Permutation decoding for binary codes from lattice graphs ⋮ Linear closures of finite geometries ⋮ Ternary codes from some reflexive uniform subset graphs ⋮ On the nullspace of arc-transitive graphs over finite fields ⋮ On the codes related to the Higman-Sims 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)\) ⋮ Codes from multipartite graphs and minimal permutation decoding sets ⋮ A useful tool for constructing linear codes ⋮ Graph switching, 2-ranks, and graphical Hadamard matrices ⋮ Binary codes from graphs on triples ⋮ The Hermitian two-graph and its code ⋮ Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs ⋮ Quadratic residue codes, rank three groups and PBIBDs
This page was built for publication: Binary codes of strongly regular graphs