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.

[1]  M. Graß.  On the minimum distance of some quadratic-residue codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[2]  Gadiel Seroussi,et al.  On the minimum distance of some quadratic residue codes , 1984, IEEE Trans. Inf. Theory.

[3]  Doug Kuhlman,et al.  The Minimum Distance of the [83, 42] Ternary Quadratic Residue Code , 1999, IEEE Trans. Inf. Theory.

[4]  M. Tomlinson,et al.  Some Results on the Weight Distributions of the Binary Double-Circulant Codes Based on Primes , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[5]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[6]  Alfred Wassermann,et al.  On the weight enumerators of duadic and quadratic residue codes , 2004, IEEE Transactions on Information Theory.

[7]  M. Tomlinson,et al.  On the Efficient Codewords Counting Algorithm and the Weight Distributions of the Binary Quadratic Double-Circulant Codes , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[8]  Chong-Dao Lee,et al.  A New Scheme to Determine the Weight Distributions of Binary Extended Quadratic Residue Codes , 2009, IEEE Transactions on Communications.

[9]  H. Mattson,et al.  New 5-designs , 1969 .

[10]  Nigel Boston.  The Minimum Distance of the [137, 69] Binary Quadratic Residue Code , 1999, IEEE Trans. Inf. Theory.