Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs

DOI10.1109/18.568714zbMath0926.94030OpenAlexW2118368475MaRDI QIDQ4361469

Vladimir D. Tonchev

Publication date: 22 February 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b2b831d6f9be14f869c7a77b0b47cff3d35e1609

zbMATH Keywords

strongly regular graphweight distributionautomorphism group of a graphoptimal linear codemajority decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

Permutation groups and binary self-orthogonal codes ⋮ Designs and codes from involutions of A_n ⋮ Binary codes of some strongly regular subgraphs of the McLaughlin graph ⋮ Linear codes and cyclic codes over finite rings and their generalizations: a survey ⋮ Designs and codes from fixed points of finite groups ⋮ On the codes related to the Higman-Sims graph ⋮ geometry ⋮ Designs and codes from fixed points of elements of Janko simple group J₁ ⋮ Quadratic residue codes, rank three groups and PBIBDs

This page was built for publication: Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs