Sciweavers

CORR
2008
Springer

On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137

14 years 16 days ago
On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the extended quadratic residue is completely determined once the number of codewords of Hamming weight j Aj, for 0 j 2m, are known. The smallest prime for which the Hamming weight distribution of the corresponding extended quadratic residue code is unknown is 137. It is shown in this paper that, for p = 137 A2m = A34 may be obtained without the need of exhaustive codeword enumeration. After the remainder of Aj required by Gleason's theorem are computed and independently verified using their congruences, the Hamming weight distributions of the binary augmented and extended quadratic residue codes of prime 137 are derived.
Cen Tjhai, Martin Tomlinson, Marcel Ambroze, Moham
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Cen Tjhai, Martin Tomlinson, Marcel Ambroze, Mohammed Ahmed
Comments (0)