“…Recently, we had the idea of using rank two primitive geometries to construct new binary codes for the McLaughlin group [13]. More precisely, we examined the binary codes obtained from the row span over F 2 of the adjacency matrices of some strongly regular graphs which occur as subgraphs of the McLaughlin graph, namely those with parameters (105,32,4,12), (120,42,8,18) and (253,112,36,60). These new codes were obtained by computing incidence matrices of rank two geometries whose elementstabilizers are maximal subgroups of the McLaughlin group.…”