Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Matthias Wählisch
Daniel P. Kennedy
Barbara Aquilani
Diana Vilela
Maud Szusterman
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Author
/
IVAN YU. MOGILNYKH
Author Info
Open Visualization
Name
Affiliation
Papers
IVAN YU. MOGILNYKH
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
19
Collaborators
Citations
PageRank
13
36
8.74
Referers
Referees
References
50
68
82
Publications (19 rows)
Collaborators (13 rows)
Referers (50 rows)
Referees (68 rows)
Title
Citations
PageRank
Year
Equitable 2-partitions of the Hamming graphs with the second eigenvalue
0
0.34
2020
On Existence Of Perfect Bitrades In Hamming Graphs
0
0.34
2020
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r, 2).
0
0.34
2019
Minimum supports of eigenfunctions of Johnson graphs.
2
0.44
2018
On components of the Kerdock codes and the dual of the BCH code C1,3
0
0.34
2018
On explicit minimum weight bases for extended cyclic codes related to Gold functions.
0
0.34
2018
On completely regular codes of covering radius 1 in the halved hypercubes.
0
0.34
2018
Propelinear codes related to some classes of optimal codes.
0
0.34
2017
On the symmetry group of the Mollard code
0
0.34
2016
To the theory of q-ary Steiner and other-type trades.
5
0.63
2016
On extending propelinear structures of the Nordstrom–Robinson code to the Hamming code
0
0.34
2015
On maximum components of a class of perfect codes.
0
0.34
2015
Transitive nonpropelinear perfect codes.
3
0.46
2015
Cameron-Liebler line classes in PG(n, 4).
9
1.09
2014
Rank spectrum of propelinear perfect binary codes.
0
0.34
2013
On the Number of Nonequivalent Propelinear Extended Perfect Codes.
3
0.48
2013
Structural properties of binary propelinear codes.
11
1.17
2012
Ranks Of Propelinear Perfect Binary Codes
1
0.37
2012
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs
2
0.39
2009
1