- Olof Heden, “On the size of the symmetry group of a perfect code”, Discrete Mathematics, 311, no. 17, 2011, 1879

- D.S. Krotov, I.Yu. Mogilnykh, V.N. Potapov, “To the theory of q-ary Steiner and other-type trades”, Discrete Mathematics, 339, no. 3, 2016, 1150

- Minjia Shi, Denis S. Krotov, “An enumeration of 1-perfect ternary codes”, Discrete Mathematics, 346, no. 7, 2023, 113437

- K. V. Vorob’ev, D. S. Krotov, “Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph”, J. Appl. Ind. Math., 9, no. 1, 2015, 141

- Alexandr Valyuzhenich, “Minimum supports of eigenfunctions of Hamming graphs”, Discrete Mathematics, 340, no. 5, 2017, 1064

- A. M. Romanov, “On full-rank perfect codes over finite fields”, J. Appl. Ind. Math., 10, no. 3, 2016, 444

- Alexander M. Romanov, “On non-full-rank perfect codes over finite fields”, Des. Codes Cryptogr., 87, no. 5, 2019, 995

- Olof Heden, “A note on the symmetry group of full rank perfect binary codes”, Discrete Mathematics, 312, no. 19, 2012, 2973

- Denis S. Krotov, “The extended 1-perfect trades in small hypercubes”, Discrete Mathematics, 340, no. 10, 2017, 2559

- Alexander M. Romanov, “Perfect mixed codes from generalized Reed–Muller codes”, Des. Codes Cryptogr., 2024
