On the regularity of perfect 2-colorings of the Johnson graph. - Ivan Yu. Mogilnykh (Probl. Inf. Transm., 2007)

Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). - Sergey V. Avgustinovich; Ivan Yu. Mogilnykh (ICMCTA, 2008)

On weak isometries of Preparata codes. - Ivan Yu. Mogilnykh (Probl. Inf. Transm., 2009)

Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. - Ivan Yu. Mogilnykh; Patric R. J. Östergård; Olli Pottonen; Faina I. Solov'eva (IEEE Trans. Inf. Theory, 2009)

Structural properties of binary propelinear codes. - Joaquim Borges; Ivan Yu. Mogilnykh; Josep Rifà; Faina I. Solov'eva (Adv. Math. Commun., 2012)

Ranks of propelinear perfect binary codes - George K. Guskov; Ivan Yu. Mogilnykh; Faina I. Solov'eva (CoRR, 2012)

Rank spectrum of propelinear perfect binary codes. - George K. Guskov; Ivan Yu. Mogilnykh; Faina I. Solov'eva (ISIT, 2013)

On the Number of Nonequivalent Propelinear Extended Perfect Codes. - Joaquim Borges; Ivan Yu. Mogilnykh; Josep Rifà; Faina I. Solov'eva (Electron. J. Comb., 2013)

Cameron-Liebler line classes in PG(n, 4). - Alexander L. Gavrilyuk; Ivan Yu. Mogilnykh (Des. Codes Cryptogr., 2014)

On the extention of propelinear structures of Nordstrom-Robinson code to Hamming code. - Ivan Yu. Mogilnykh (CoRR, 2015)

On maximum components of a class of perfect codes. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (CoRR, 2015)

Transitive nonpropelinear perfect codes. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Discret. Math., 2015)

On separability of the classes of homogeneous and transitive perfect binary codes. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2015)

To the theory of q-ary Steiner and other-type trades. - Denis S. Krotov; Ivan Yu. Mogilnykh; Vladimir N. Potapov (Discret. Math., 2016)

On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code. - Ivan Yu. Mogilnykh (Probl. Inf. Transm., 2016)

On the symmetry group of the Mollard code. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2016)

Propelinear codes related to some classes of optimal codes. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2017)

A note on regular subgroups of the automorphism group of the linear Hadamard code. - Ivan Yu. Mogilnykh (CoRR, 2018)

On components of a Kerdock code and the dual of the BCH code C1, 3. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (CoRR, 2018)

On completely regular codes of covering radius 1 in the halved hypercubes. - Denis S. Krotov; Ivan Yu. Mogilnykh; Anastasia Yu. Vasil'eva (CoRR, 2018)

On explicit minimum weight bases for extended cyclic codes related to Gold functions. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Des. Codes Cryptogr., 2018)

Minimum supports of eigenfunctions of Johnson graphs. - Konstantin V. Vorob'ev; Ivan Yu. Mogilnykh; Alexandr Valyuzhenich (Discret. Math., 2018)

A concatenation construction for propelinear perfect codes from regular subgroups of GA(r, 2). - Ivan Yu. Mogilnykh; Faina I. Solov'eva (CoRR, 2019)

Single orbit affine generators for extended BCH codes with designed distance three. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (ACCT, 2020)

Coordinate transitivity of extended perfect codes and their SQS. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (CoRR, 2020)

On components of the Kerdock codes and the dual of the BCH code C1, 3. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Discret. Math., 2020)

On existence of perfect bitrades in Hamming graphs. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Discret. Math., 2020)

Equitable 2-partitions of the Hamming graphs with the second eigenvalue. - Ivan Yu. Mogilnykh; Alexandr Valyuzhenich (Discret. Math., 2020)

On Bases of BCH Codes with Designed Distance 3 and Their Extensions. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2020)

q-ary Propelinear Perfect Codes from the Regular Subgroups of the GA(r, q) and Their Ranks. - Ivan Yu. Mogilnykh (CoRR, 2021)

Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii. - Ivan Yu. Mogilnykh (Electron. J. Comb., 2022)

On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group. - Ivan Yu. Mogilnykh (Probl. Inf. Transm., 2022)

On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2022)

L∞ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs. - E. A. Bespalov; Ivan Yu. Mogilnykh; Konstantin V. Vorob'ev (CoRR, 2023)

On completely regular codes with minimum eigenvalue in geometric graphs. - Ivan Yu. Mogilnykh; Konstantin V. Vorob'ev (Discret. Math., 2023)

Constructions and Invariants of Optimal Codes in the Lee Metric. - Ivan Yu. Mogilnykh; Faina I. Solov'eva (Probl. Inf. Transm., 2023)

Binary codes from subset inclusion matrices. - Alexey D. Marin; Ivan Yu. Mogilnykh (CoRR, 2024)

Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs. - Ivan Yu. Mogilnykh; Anna A. Taranenko; Konstantin V. Vorob'ev (Discret. Math., 2025)

Multispreads. - Denis S. Krotov; Ivan Yu. Mogilnykh (Finite Fields Their Appl., 2025)

On null completely regular codes in Manhattan metric. - Ivan Yu. Mogilnykh; Anastasia Yu. Vasil'eva (CoRR, 2025)