No primitive binaryt-error-correcting BCH code witht > 2is quasi-perfect (Corresp.)
Tor Helleseth · IEEE Transactions on Information Theory · 1979
Gorenstein, Peterson, and Zierler have conjectured that not-error-correcting BCH code of length2^{m} - 1witht > 2is quasi-perfect. This conjecture is proved. The covering radius of a code is defined as the smallest integer\rhosuch that the union of the spheres of radius ia about the codewords equals the containing space.