No primitive binary t -error-correcting BCH code with t > 2 is quasi-perfect (Corresp.)

Tor Helleseth. No primitive binary t -error-correcting BCH code with t > 2 is quasi-perfect (Corresp.). IEEE Transactions on Information Theory, 25(3):361-362, 1979. [doi]

Abstract

Abstract is missing.