Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect

It is shown that all two-error correcting Bose-Chaudhuri codes are close-packed and therefore optimum. A method is also given for finding cosets of large weight in t > 2-error correcting Bose-Chaudhuri codes, which suggests that no other nontrivial codes are close-packed.