Ivan Yu. Mogilnykh

Orcid: 0000-0003-3770-8523

Affiliations:
  • Novosibirsk State University, Russia
  • Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Ivan Yu. Mogilnykh authored at least 37 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Constructions and Invariants of Optimal Codes in the Lee Metric.
Probl. Inf. Transm., July, 2023

On completely regular codes with minimum eigenvalue in geometric graphs.
Discret. Math., July, 2023

Multispreads.
CoRR, 2023

L<sub>∞</sub> norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs.
CoRR, 2023

2022
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes.
Probl. Inf. Transm., 2022

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

Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii.
Electron. J. Comb., 2022

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

2020
On Bases of BCH Codes with Designed Distance 3 and Their Extensions.
Probl. Inf. Transm., 2020

Equitable 2-partitions of the Hamming graphs with the second eigenvalue.
Discret. Math., 2020

On existence of perfect bitrades in Hamming graphs.
Discret. Math., 2020

On components of the Kerdock codes and the dual of the BCH code C1, 3.
Discret. Math., 2020

Coordinate transitivity of extended perfect codes and their SQS.
CoRR, 2020

Single orbit affine generators for extended BCH codes with designed distance three.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r, 2).
CoRR, 2019

2018
Minimum supports of eigenfunctions of Johnson graphs.
Discret. Math., 2018

On explicit minimum weight bases for extended cyclic codes related to Gold functions.
Des. Codes Cryptogr., 2018

On completely regular codes of covering radius 1 in the halved hypercubes.
CoRR, 2018

On components of a Kerdock code and the dual of the BCH code C<sub>1, 3</sub>.
CoRR, 2018

A note on regular subgroups of the automorphism group of the linear Hadamard code.
CoRR, 2018

2017
Propelinear codes related to some classes of optimal codes.
Probl. Inf. Transm., 2017

2016
On the symmetry group of the Mollard code.
Probl. Inf. Transm., 2016

On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code.
Probl. Inf. Transm., 2016

To the theory of q-ary Steiner and other-type trades.
Discret. Math., 2016

2015
On separability of the classes of homogeneous and transitive perfect binary codes.
Probl. Inf. Transm., 2015

Transitive nonpropelinear perfect codes.
Discret. Math., 2015

On maximum components of a class of perfect codes.
CoRR, 2015

On the extention of propelinear structures of Nordstrom-Robinson code to Hamming code.
CoRR, 2015

2014
Cameron-Liebler line classes in PG(n, 4).
Des. Codes Cryptogr., 2014

2013
On the Number of Nonequivalent Propelinear Extended Perfect Codes.
Electron. J. Comb., 2013

Rank spectrum of propelinear perfect binary codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Ranks of propelinear perfect binary codes
CoRR, 2012

Structural properties of binary propelinear codes.
Adv. Math. Commun., 2012

2009
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs.
IEEE Trans. Inf. Theory, 2009

On weak isometries of Preparata codes.
Probl. Inf. Transm., 2009

2008
Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3).
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007
On the regularity of perfect 2-colorings of the Johnson graph.
Probl. Inf. Transm., 2007


  Loading...