On the minimum weights of binary extended quadratic residue codes

This paper used an efficient scheme to determine the number of codewords for a given weight in the binary extended quadratic residue code. The scheme consists of a weight-counting algorithm and the combinatorial designs of the Assmus-Mattson theorem. As a consequence, the values of minimum weights of the binary (192, 96), (194, 97), and (200, 100) extended quadratic residue codes are 28, 28, and 32, respectively. And all the minimum weights of the binary extended quadratic residue codes of lengths less than or equal to 200 are determined.