29 citations · 53 across the 27 of their papers we have counts for
28 papers
Minimum distances of LDPC codes in 5G standard
V. R. Danilko, I. Yu. Mogilnykh, Ya. A. Tikhomolov
We propose several approaches for bounding the minim\-um distances of the family of quasi-cyclic LDPC codes in the 5G NR standard. In particular, we show that the high-rate [9984,…
On null completely regular codes in Manhattan metric
I. Yu. Mogilnykh, A. Yu. Vasil'eva
We investigate the class of completely regular codes in graphs with a distance partition C_0,..., C_ρ, where each set C_i, for 0<=i<=r-1, is an independent set. This work focuses o…
Binary codes from subset inclusion matrices
Alexey D. Marin, Ivan Yu. Mogilnykh
In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices , representing -element subsets…
Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
Ivan Mogilnykh, Anna Taranenko, Konstantin Vorob'ev
We obtain a classification of the completely regular codes with covering radius 1 and the second eigenvalue in the Hamming graphs H(3,q) up to q and intersection array. Due to work…
Multispreads
Denis S. Krotov, Ivan Yu. Mogilnykh
Additive one-weight codes over a finite field of non-prime order are equivalent to special subspace coverings of the points of a projective space, which we call multispreads. The c…
norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
E. A. Bespalov, I. Yu. Mogilnykh, K. V. Vorob'ev
We study nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and the Johnson graphs. For the first eigenvalue we obtain the minimums of -nor…