Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes (Q2430684)

Best and Brouwer (1977) used linear programming to show that shortening any 1-perfect binary code \(i\) times with \(1 \leq i \leq 3\) yields an optimal \((2^m-1-i, 2^{2^m -m-1-i}, 3)\) code. It has been left open whether all optimal codes with these parameters can be obtained from this way up to equivalence. Etzion and Vardy (1994) asked this question and Blackmore (1999) gave an affirmative answer to the question for \(i=1\). The paper under review gives a negative answer for \(i=2\) by constructing two \((13, 512, 3)\) codes which are not doubly shortened perfect codes.