1. S. V. Avgustinovich and F. I. Solov’eva, “Constructing the Perfect Binary Codes by Sequential Switchings of α-Components,” Problemy Peredachi Informatsii 33(3), 15–21 (1997).
2. I. Sh. o. Aliev, “Combinatorial Designs and Algebras,” Sibirsk. Mat. Zh. 13(3), 499–509 (1972) [Siberian Math. J. 13 (3), 341–348 (1972)].
3. Yu. L. Vasil’ev, “On Nongroup Densely Packed Codes,” Problemy Kibernetiki No. 8, 337–339 (1962).
4. V. A. Zinov’ev and D. V. Zinov’ev, “About Vasil’ev Codes of Length n = 2m and Duplication of Steiner Systems S(n, 4, 3) of Given Rank,” Problemy Peredachi Informatsii 42(1), 13–33 (2006).
5. V.A. Zinov’ev and D. V. Zinov’ev, “On Solvability of Steiner Systems S(v = 2m, 4, 3) of Rank r ≤ v − m+1 over $$\mathbb{F}^2$$ ,” Problemy Peredachi Informatsii 43(1), 39–55 (2007).