Denis S. Krotov, 2019 IEEE International Symposium on Information Theory (ISIT), 2019, 2957
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
Vladimir N. Potapov, “On q-ary bent and plateaued functions”, Des. Codes Cryptogr., 88, no. 10, 2020, 2037
Alexandr Valyuzhenich, Konstantin Vorob’ev, “Minimum supports of functions on the Hamming graphs with spectral constraints”, Discrete Mathematics, 342, no. 5, 2019, 1351
Alexandr Valyuzhenich, “Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph”, Discrete Mathematics, 344, no. 3, 2021, 112228
Denis S. Krotov, 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2023, 82
V. N. Potapov, S. V. Avgustinovich, “Combinatorial Designs, Difference Sets, and Bent Functions as Perfect Colorings of Graphs and Multigraphs”, Sib Math J, 61, no. 5, 2020, 867
Evgeny Bespalov, “On the non-existence of extended 1-perfect codes and MDS codes”, Journal of Combinatorial Theory, Series A, 189, 2022, 105607
Evgeny A. Bespalov, Denis S. Krotov, Aleksandr A. Matiushev, Anna A. Taranenko, Konstantin V. Vorob'ev, “Perfect 2‐colorings of Hamming graphs”, J of Combinatorial Designs, 29, no. 6, 2021, 367
Alexandr Valyuzhenich, “Minimum supports of eigenfunctions of Hamming graphs”, Discrete Mathematics, 340, no. 5, 2017, 1064