On the dual binary codes of the triangular graphs

Assmus, 1992, Designs and their Codes, vol. 103 Assmus, 1996, Designs and codes: an update, Des. Codes Cryptogr., 9, 7, 10.1023/A:1027359905521 Brouwer, 1992, On the p-rank of the adjacency matrices of strongly regular graphs, J. Algebraic Combin., 1, 329, 10.1023/A:1022438616684 Brouwer, 1984, Strongly regular graphs and partial geometries, 85 Conway, 1985 Haemers, 1999, Binary codes of strongly regular graphs, Des. Codes Cryptogr., 17, 187, 10.1023/A:1026479210284 Key, 2002, Designs, codes and graphs from the Janko groups J1 and J2, J. Combin. Math. Combin. Comput., 40, 143 Key, 2003, On some designs and codes from primitive representations of some finite simple groups, J. Combin. Math. Combin. Comput., 45, 3 Key, 2004, Permutation decoding for the binary codes from triangular graphs, European J. Combin., 25, 113, 10.1016/j.ejc.2003.08.001 Liebeck, 1987, A classification of the maximal subgroups of the finite alternating and symmetric groups, J. Algebra, 111, 365, 10.1016/0021-8693(87)90223-7 B.G. Rodrigues, On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs, Ars Combin. (in press) B.G. Rodrigues, Codes of designs and graphs from finite simple groups, Ph.D. Thesis, University of Natal, Pietermaritzburg, 2002 Tonchev, 1988, Combinatorial Configurations Designs, Codes, Graphs, vol. 40