Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes

Using maximal arcs in PG(3, 2m), we give a new proof of the fact that the binary cyclic code C(m)1, 22h−2h+1, the code of length 2m−1 with defining zeroes α and αt, t=22h−2h+1, where α is a primitive element in GF(2m), is 2-error-correcting when gcd(m, h)=1.