1. S. V. Avgustinovich and F. I. Solov’eva, “Construction of Perfect Binary Codes by Sequential Shifts of ˜a-Components,” Problemy Peredachi Informatsii 33 (3), 15–21 (1997) [Problems Inform. Transmission 33 (3), 202–207 (1997)].
2. Yu. L. Vasil’ev, “On Nongroup Close-Packed Codes,” in Problems of Cybernetics, Vol. 8, Ed. by A. A. Lyapunov (Fizmatgiz, Moscow, 1962), pp. 337–339.
3. S. A. Malyugin, “On Enumeration of the Perfect Binary Codes of Length 15,” Diskretn. Anal. Issled. Oper. Ser. 2, 6 (2), 48–73 (1999) [Discrete Appl. Math. 135 (1–3), 161–181 (2004)].
4. S. A. Malyugin, “Nonsystematic Perfect Binary Codes,” Diskretn. Anal. Issled. Oper. Ser. 1, 8 (1), 55–76 (2001).
5. S. A. Malyugin, “Perfect Binary Codes of Infinite Length,” Prikl. Diskretn. Mat., Prilozh. No. 8, 117–120 (2015).