Science activity
Articles (28) More info
| 1 |
Mogilnykh I.
, Taranenko A.
, Vorob'ev K.
Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs Discrete Mathematics. 2025. V.348. N2. 114296 :1-16. DOI: 10.1016/j.disc.2024.114296 WOS Scopus РИНЦ OpenAlex |
| 2 |
Krotov D.S.
, Mogilnykh I.Y.
Multispreads Finite Fields and their Applications. 2025. V.108. 102675 :1-25. DOI: 10.1016/j.ffa.2025.102675 Scopus |
| 3 |
Mogilnykh I.Y.
, Vorob'ev K.V.
On completely regular codes with minimum eigenvalue in geometric graphs Discrete Mathematics. 2023. V.346. N7. 113357 :1-13. DOI: 10.1016/j.disc.2023.113357 WOS Scopus РИНЦ OpenAlex |
| 4 |
Bespalov E.A.
, Mogilnykh I.Y.
, Vorob’ev K.V.
L∞ norm minimization problems for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2023. V.20. N2. P.1125-1149. DOI: 10.33048/semi.2023.20.070 WOS Scopus РИНЦ |
| 5 |
Mogilnykh I.
, Vorob'ev K.
Perfect bitrades in Johnson graphs In compilation 2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY). 2023. – C.54-58. DOI: 10.1109/Redundancy59964.2023.10330180 Scopus OpenAlex |
| 6 |
Mogilnykh I.Y.
, Solov’eva F.I.
Constructions and Invariants of Optimal Codes in the Lee Metric Problems of Information Transmission. 2023. V.59. N2. P.71-85. DOI: 10.1134/s0032946023020011 WOS Scopus РИНЦ OpenAlex |
| 7 |
Mogilnykh I.Y.
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group Problems of Information Transmission. 2022. V.58. N1. P.58-71. DOI: 10.1134/S0032946022010045 WOS Scopus РИНЦ OpenAlex |
| 8 |
Mogilnykh I.
Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii Electronic Journal of Combinatorics. 2022. V.29. N2. P2.57 . DOI: 10.37236/10083 WOS Scopus РИНЦ OpenAlex |
| 9 |
Mogilnykh I.
Codes in Star and Bubble-sort graphs In compilation Сборник International Conference AUTOMATICS AND INFORMATICS`2021. 2021. – C.230-233. DOI: 10.1109/ICAI52893.2021.9639869 OpenAlex |
| 10 |
Mogilnykh I.
, Valyuzhenich A.
Equitable 2-partitions of the Hamming graphs with the second eigenvalue Discrete Mathematics. 2020. V.343. 112039 :1-9. DOI: 10.1016/j.disc.2020.112039 WOS Scopus РИНЦ OpenAlex |
| 11 |
Mogilnykh I.Y.
, Solov’eva F.I.
On existence of perfect bitrades in Hamming graphs Discrete Mathematics. 2020. V.343. N12. 112128 . DOI: 10.1016/j.disc.2020.112128 WOS Scopus РИНЦ OpenAlex |
| 12 |
Mogilnykh I.Y.
Perfect codes from $\mathrm{PGL}(2,5)$ in the Star graphs Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2020. V.17. P.534-539. DOI: 10.33048/semi.2020.17.034 WOS Scopus РИНЦ OpenAlex |
| 13 |
Могильных И.Ю.
, Соловьева Ф.И.
О базисах кодов БЧХ с конструктивным расстоянием 3 и их расширений Проблемы передачи информации. 2020. V.56. N4. P.10-18. DOI: 10.31857/s0555292320040026 WOS РИНЦ OpenAlex |
| 14 |
Mogilnykh I.Y.
, Solov'eva F.I.
Coordinate transitivity of a class of extended perfect codes and their SQS Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2020. V.17. P.1451-1462. DOI: 10.33048/semi.2020.17.101 WOS Scopus РИНЦ OpenAlex |
| 15 |
Mogilnykh I.Y.
A note on regular subgroups of the automorphism group of the linear Hadamard code Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.15. P.1455-1462. DOI: 10.33048/semi.2018.15.119 WOS Scopus РИНЦ OpenAlex |
| 16 |
Mogilnykh I.Y.
, Solov'eva F.I.
A concatenation construction for propelinear perfect codes from regular subgroups of $\mathrm {GA}(r,2)$ Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.1689-1702. DOI: 10.33048/semi.2019.16.119 WOS Scopus РИНЦ OpenAlex |
| 17 |
Mogilnykh I.Y.
, Solov’eva F.I.
On components of the Kerdock codes and the dual of the BCH code C_1,3 Discrete Mathematics. 2019. V.343. N2. 111668 :1-8. DOI: 10.1016/j.disc.2019.111668 WOS Scopus РИНЦ OpenAlex |
| 18 |
Mogilʹnykh I.Y.
, Vorobʹev K.V.
, Valyuzhenich A.A.
MMS-type problems for Johnson scheme Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2018. V.15. P.1663-1670. DOI: 10.33048/semi.2018.15.137 WOS Scopus OpenAlex |
| 19 |
Vorobʹev K.V.
, Mogilʹnykh I.Y.
, Valyuzhenich A.A.
Minimum supports of eigenfunctions of Johnson graphs Discrete Mathematics. 2018. V.341. N8. P.2151-2158. DOI: 10.1016/j.disc.2018.04.018 WOS Scopus OpenAlex |
| 20 |
Mogilnykh I.Y.
, Solov’eva F.I.
On explicit minimum weight bases for extended cyclic codes related to Gold functions Designs, Codes and Cryptography. 2018. V.86. N11. P.2619-2627. DOI: 10.1007/s10623-018-0464-7 WOS Scopus РИНЦ OpenAlex |
| 21 |
Krotov D.S.
, Mogilnykh I.Y.
, Potapov V.N.
To the theory of q-ary Steiner and other-type trades Discrete Mathematics. 2016. V.339. N3. P.1150-1157. DOI: 10.1016/j.disc.2015.11.002 WOS Scopus РИНЦ OpenAlex |
| 22 |
Mogilnykh I.Y.
, Solov’eva F.I.
Transitive nonpropelinear perfect codes Discrete Mathematics. 2014. V.338. N3. P.174-182. DOI: 10.1016/j.disc.2014.11.001 WOS Scopus РИНЦ OpenAlex |
| 23 |
Gavrilyuk A.L.
, Mogilnykh I.Y.
Cameron–Liebler line classes in PG ( n , 4 ) Designs, Codes and Cryptography. 2013. V.73. N3. P.969-982. DOI: 10.1007/s10623-013-9838-z WOS Scopus РИНЦ OpenAlex |
| 24 |
Borges J.
, Mogilnykh I.Y.
, Rifà J.
, Solov'eva F.I.
Structural properties of binary propelinear codes Advances in Mathematics of Communications. 2012. V.6. N3. P.329-346. DOI: 10.3934/amc.2012.6.329 WOS Scopus РИНЦ OpenAlex |
| 25 |
Borges J.
, Mogilnykh I.Y.
, Rifà J.
, Solov'eva F.I.
On the Number of Nonequivalent Propelinear Extended Perfect Codes Electronic Journal of Combinatorics. 2012. V.20. N2. P37 . DOI: 10.37236/3220 WOS Scopus РИНЦ OpenAlex |
| 26 |
Avgustinovich S.V.
, Mogilnykh I.Y.
Induced perfect colorings Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2011. V.8. 316 :1-1. |
| 27 |
Mogilnykh I.Y.
, Ostergard P.R.J.
, Pottonen O.
, Solov'eva F.I.
Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs IEEE Transactions on Information Theory. 2009. V.55. N6. P.2622-2625. DOI: 10.1109/tit.2009.2018338 WOS Scopus РИНЦ OpenAlex |
| 28 |
Avgustinovich S.
, Mogilnykh I.
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) Lecture Notes in Computer Science. 2008. P.11-19. DOI: 10.1007/978-3-540-87448-5_2 WOS Scopus РИНЦ OpenAlex |
Conference theses (3) More info
| 1 |
Danilko V.R.
, Mogilnykh I.Y.
Some binary codes from Hamming distance matrices In compilation Тезисы докладов международной конференции "Мальцевские чтения", 11-15 ноября 2024 г.. 2024. – C.113. |
| 2 |
Vasil'eva A.Y.
, Mogilnykh I.Y.
On completely regular codes in the multidimensional rectangular grid In compilation Тезисы докладов международной конференции "Мальцевские чтения", 11-15 ноября 2024 г.. 2024. – C.198. |
| 3 |
Krotov D.S.
, Mogilnykh I.Y.
, Vasilieva A.Y.
On existence of completely regular codes in hypercube and halved cube graphs In compilation Международная конференция «Мальцевские чтения», 19-23 августа 2019 г. Тезисы докладов.. – ИМ СО РАН, НГУ., 2019. – C.38. |
Conference attendances (9) More info
| 1 |
Danilko V.R.
, Mogilnykh I.Y.
Some binary codes from Hamming distance matrices Международная конференция "Мальцевские чтения" 11-15 Nov 2024 |
| 2 |
Vasil'eva A.Y.
, Mogilnykh I.Y.
On completely regular codes in the multidimensional rectangular grid Международная конференция "Мальцевские чтения" 11-15 Nov 2024 |
| 3 |
Krotov D.
, Mogilʹnykh I.Y.
Multispreads and additive completely regular codes The 23rd USTC-AHU-AHJZU Joint Seminar on Algebraic Combinatorics 02-02 Sep 2023 |
| 4 |
Mogilnykh I.
, Vorob'ev K.
Nowhere-zero eigenflow problems for distance-regular graphs The 8th Workshop on «Algebraic Graph Theory and its Applications» 01-04 Mar 2023 |
| 5 |
Mogilʹnykh I.Y.
, Vorobʹev K.V.
COMPLETELY REGULAR CODES OF JOHNSON GRAPHS WITH MINIMUM EIGENVALUE Международная конференция "МАЛЬЦЕВСКИЕ ЧТЕНИЯ" 14-18 Nov 2022 |
| 6 |
Mogilʹnykh I.Y.
, Marin A.
Minimization problem for the number of blocks in the binary t-(n,k)-designs The 7th Workshop on «Algebraic Graph Theory and its Applications» 01-04 Nov 2022 |
| 7 |
Mogilnykh I.
, Марьин А.Д.
On the minimum distances of codes from the inclusion matrices of 2-subsets vs. k-subsets The 6th Workshop On Algebraic Graph Theory and Its Applications 21-25 Mar 2022 |
| 8 |
Mogilʹnykh I.Y.
q-ary propelinear perfect codes from the regular subgroups of the GA(r; q) and their ranks WCC 2022: The Twelfth International Workshop on Coding and Cryptography 07-11 Mar 2022 |
| 9 |
Mogilʹnykh I.Y.
, Solov'eva F.
Weight distributions of a class of codes with parameters of Reed - Muller codes WCC 2022: The Twelfth International Workshop on Coding and Cryptography 07-11 Mar 2022 |
Identifiers
ORCID:
Scopus ID:
Elibrary ID:
Degrees
2010 - Ph.D.