Maximal arcs in projective three-spaces and double-error-correcting cyclic codes

摘要

Using maximal arcs in PG(3, 2(m)), we give a new proof of the fact that the binary cyclic code C-1,2(h - 2h + 1)(m)(2), the code of length 2(m) - 1 with defining zeroes alpha and alpha ', t = 2(2h) - 2(h) + 1, where alpha is a primitive element in GF(2(m)), is 2-error-correcting when gcd(m, h)= 1. (C) 2001 Academic Press. [References: 12]