Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph

Dimitri Leemans, Bernardo Rodrigues

Abstract


We describe a number of properties of some ternary linearcodes defined by the adjacency matrices of some stronglyregular graphs that occur as induced subgraphs of the McLaughlin graph, namely the graphs withparameters $(105,72,51,45), (120,77,52,44), (176, 105, 68, 54),$ and$(253, 140, 87, 65)$ respectively. We show that the codes withparameters $[120,21,30]_3$,$[120,99,6]_3$, $[176, 21, 56]_3$, $[176, 155, 6]_3$, $[253, 22, 97]_3$ and  $[253, 231, 8]_3$  obtained from these graphs are linear codes with complementary duals and thus meet the asymptotic Gilbert–Varshamov bound.

Keywords


linear codes, strongly regular graphs, symmetric designs, automorphism groups

Full Text:

PDF


ISSN: 1331-0623 (Print), 1848-8013 (Online)