Binary codes of some strongly regular subgraphs of the McLaughlin graph
type: Item
instance of: scholarly article
title: Binary codes of some strongly regular subgraphs of the McLaughlin graph
zbMATH Open document ID: 1258.05130
author: Dimitri Leemans
author: B. G. Rodrigues
published in: Designs, Codes and Cryptography
publication date: 2013-02-05T00:00:00Z
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 20D45
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 6134580
zbMATH Keywords: strongly regular graphs
zbMATH Keywords: symmetric designs
zbMATH Keywords: automorphism groups
zbMATH Keywords: binary codes
zbMATH Keywords: McLaughlin graph
describes a project that uses: Magma
describes a project that uses: Code Tables
MaRDI profile type: Publication
full work available at URL: s10623-011-9589-7
OpenAlex ID: W2070678610
cites work: Q4004114
cites work: The Magma algebra system. I: The user language
cites work: On the \(p\)-rank of the adjacency matrices of strongly regular graphs
cites work: The Gewirtz graph: An exercise in the theory of graph spectra
cites work: Q4242008
cites work: A rank six geometry related to the McLaughlin sporadic simple group
cites work: A global code invariant under the Higman-Sims group
cites work: Q3684278
cites work: The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
cites work: Classification of some strongly regular subgraphs of the McLaughlin graph
cites work: Some strongly regular graphs and self-orthogonal codes from the unitary group U4(3)
cites work: Codes from incidence matrices of graphs
cites work: The regular two-graph on 276 vertices
cites work: Binary codes of strongly regular graphs
cites work: Q4839675
cites work: Permutation decoding for the binary codes from triangular graphs.
cites work: Permutation decoding for binary codes from lattice graphs
cites work: Some designs and codes invariant under the simple group Co\(_{2}\)
cites work: Uniqueness of strongly regular graphs having minimal \(p\)-rank
cites work: Some optimal codes related to graphs invariant under the alternating group \(A_8\)
cites work: Three new distance-regular graphs
cites work: Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
DOI: 10.1007/S10623-011-9589-7
Recommended article: Q2951854
Recommended article: Binary codes of strongly regular graphs
Recommended article: Classification of some strongly regular subgraphs of the McLaughlin graph
Recommended article: Strongly regular graphs from reducible cyclic codes
Recommended article: Q5284014
Recommended article: Codes on Graphs: Duality and MacWilliams Identities
Recommended article: Some new two-weight codes and strongly regular graphs
Recommended article: Codes from incidence matrices of some regular graphs
Recommended article: Binary codes from graphs on triples
Recommended article: Two new optimal ternary two-weight codes and strongly regular graphs
description: scientific article; zbMATH DE number 6134580