A note on the Assmus-Mattson theorem for some binary codes (Q2672304)

The classical Assmus-Mattson theorem [\textit{E. F. Assmus jun.} and \textit{H. F. Mattson jun.}, J. Comb. Theory 6, 122--151 (1969; Zbl 0179.02901] is a famous result that relates linear codes and combinatorial designs. In particular, it shows that if the dual of a given code has few nonzero weights in an interval, then the supports of codewords of fixed Hamming weight close enough to the minimum distance of the code form the blocks of a design. In this paper, the authors discuss a generalization of the Assmus-Mattson theorem for certain binary codes, and provide a new characterization of the extended Golay code \(\mathcal{G}_{24}\).