Binary codes of some strongly regular subgraphs of the McLaughlin graph

DOI10.1007/S10623-011-9589-7MaRDI QIDQ1936495zbMATH OpenOpenAlexFDO

Authors Dimitri Leemans, B. G. Rodrigues

Publication date 5 February 2013

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-011-9589-7

zbMATH Keywords

automorphism groupsbinary codesMcLaughlin graphstrongly regular graphssymmetric designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Association schemes, strongly regular graphs (05E30) Automorphisms of abstract finite groups (20D45) Linear codes (general theory) (94B05)

Recommendations

• Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
• Binary codes of strongly regular graphs
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Strongly regular graphs from reducible cyclic codes
• scientific article; zbMATH DE number 975345
• Codes on Graphs: Duality and MacWilliams Identities
• Some new two-weight codes and strongly regular graphs
• Codes from incidence matrices of some regular graphs
• Binary codes from graphs on triples
• Two new optimal ternary two-weight codes and strongly regular graphs

Cites work

• A global code invariant under the Higman-Sims group
• A rank six geometry related to the McLaughlin sporadic simple group
• Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
• Binary codes of strongly regular graphs
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Codes from incidence matrices of graphs
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 1284414 (Why is no real title available?)
• scientific article; zbMATH DE number 775176 (Why is no real title available?)
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Permutation decoding for binary codes from lattice graphs
• Permutation decoding for the binary codes from triangular graphs.
• Some designs and codes invariant under the simple group Co\(_{2}\)
• Some optimal codes related to graphs invariant under the alternating group A₈
• Some strongly regular graphs and self-orthogonal codes from the unitary group \(U_{4}(3)\)
• The Gewirtz graph: An exercise in the theory of graph spectra
• The Magma algebra system. I: The user language
• The regular two-graph on 276 vertices
• The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
• Three new distance-regular graphs
• Uniqueness of strongly regular graphs having minimal p-rank

Cited in

(7)

• Binary codes of strongly regular graphs
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
• Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
• On primitive geometries of rank two
• Ball packings with high chromatic numbers from strongly regular graphs
• The adjacency codes of the first yellow graphs

Describes a project that uses

Uses Software

• Magma
• Code Tables

This page was built for publication: Binary codes of some strongly regular subgraphs of the McLaughlin graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936495)