Binary Codes of Strongly Regular Graphs

Authors:
Willem H. Haemers;René Peeters;Jeroen M. Van Rijckevorsel
Affiliations:
Department of Econometrics, Tilburg University, 5000 LE Tilburg, The Netherlands;Department of Econometrics, Tilburg University, Brabant 5000 LE Tilburg, The Netherlands;Department of Econometrics, Tilburg University, Brabant 5000 LE Tilburg, The Netherlands
Venue:
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Year:
1999

Citing 9
Cited 7

Bruck nets, codes, and characters of loops

Designs, Codes and Cryptography
Designs and their codes

Designs and their codes
Some 2–ranks

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
A design and a code invariant under the simple group Co3

Journal of Combinatorial Theory Series A
On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
Designs and Codes: An update

Designs, Codes and Cryptography - Special issue containing papers presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries
Binary Codes of Odd-order Nets

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Designs, Graphs, Codes, and Their Links

Designs, Graphs, Codes, and Their Links
Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs

IEEE Transactions on Information Theory

Permutation decoding for the binary codes from triangular graphs

European Journal of Combinatorics
On the dual binary codes of the triangular graphs

European Journal of Combinatorics
Codes associated with triangular graphs and permutation decoding

International Journal of Information and Coding Theory
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics
On the nullspace of arc-transitive graphs over finite fields

Journal of Algebraic Combinatorics: An International Journal
Binary codes of some strongly regular subgraphs of the McLaughlin graph

Designs, Codes and Cryptography
Hulls of codes from incidence matrices of connected regular graphs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

For strongly regulargraphs ith adjacency matrix A, we look at the binarycodes generated by A and A+I. We determinethese codes for some families of graphs, e pay attention tothe relation beteen the codes of switching equivalent graphsand, ith the exception of two parameter sets, we generate bycomputer the codes of all knon strongly regular graphs on fewerthan 45 vertices.