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

Some binary linear codes of length 50 and 100 are constructed using the adjacency matrices of the Hoffman-Singleton graph and the Higman-Sims graph, Some of the codes are optimal or nearly optimal for the given length and dimension. The dual codes admit majority logic decoding.