An efficient scheme to determine the weight distribution of binary (138, 69, 22) extended quadratic residue code

This paper utilizes an efficient scheme which consists of a weight-counting algorithm, the combinatorial designs of the Assmus-Mattson theorem, and the weight polynomial of Gleason’s theorem to determine the weight distributions of binary extended quadratic residue codes. As a consequence, the weight distribution of binary (138, 69, 22) extended quadratic residue code is given.