default search action
Ivan Yu. Mogilnykh
Person information
- affiliation: Novosibirsk State University, Russia
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i17]Alexey D. Marin, Ivan Yu. Mogilnykh:
Binary codes from subset inclusion matrices. CoRR abs/2408.12154 (2024) - 2023
- [j23]Ivan Yu. Mogilnykh, Konstantin V. Vorob'ev:
On completely regular codes with minimum eigenvalue in geometric graphs. Discret. Math. 346(7): 113357 (2023) - [j22]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Constructions and Invariants of Optimal Codes in the Lee Metric. Probl. Inf. Transm. 59(2): 71-85 (2023) - [i16]E. A. Bespalov, Ivan Yu. Mogilnykh, Konstantin V. Vorob'ev:
L∞ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs. CoRR abs/2304.00922 (2023) - [i15]Denis S. Krotov, Ivan Yu. Mogilnykh:
Multispreads. CoRR abs/2312.07883 (2023) - 2022
- [j21]Ivan Yu. Mogilnykh:
Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii. Electron. J. Comb. 29(2) (2022) - [j20]Ivan Yu. Mogilnykh:
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group. Probl. Inf. Transm. 58(1): 58-71 (2022) - [j19]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes. Probl. Inf. Transm. 58(3): 231-241 (2022) - [i14]Ivan Yu. Mogilnykh, Konstantin V. Vorob'ev:
On completely regular codes with minimum eigenvalue in geometric graphs. CoRR abs/2210.11184 (2022) - 2021
- [i13]Ivan Yu. Mogilnykh:
q-ary Propelinear Perfect Codes from the Regular Subgroups of the GA(r, q) and Their Ranks. CoRR abs/2112.08659 (2021) - 2020
- [j18]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On components of the Kerdock codes and the dual of the BCH code C1, 3. Discret. Math. 343(2): 111668 (2020) - [j17]Ivan Yu. Mogilnykh, Alexandr Valyuzhenich:
Equitable 2-partitions of the Hamming graphs with the second eigenvalue. Discret. Math. 343(11): 112039 (2020) - [j16]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On existence of perfect bitrades in Hamming graphs. Discret. Math. 343(12): 112128 (2020) - [j15]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Bases of BCH Codes with Designed Distance 3 and Their Extensions. Probl. Inf. Transm. 56(4): 309-316 (2020) - [c3]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Single orbit affine generators for extended BCH codes with designed distance three. ACCT 2020: 1-3 - [i12]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Coordinate transitivity of extended perfect codes and their SQS. CoRR abs/2009.08191 (2020) - [i11]Ivan Yu. Mogilnykh:
Completely regular codes in Johnson and Grassmann graphs with small covering radii. CoRR abs/2012.06970 (2020)
2010 – 2019
- 2019
- [i10]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r, 2). CoRR abs/1905.10005 (2019) - [i9]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On existence of perfect bitrades in Hamming graphs. CoRR abs/1912.09089 (2019) - 2018
- [j14]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On explicit minimum weight bases for extended cyclic codes related to Gold functions. Des. Codes Cryptogr. 86(11): 2619-2627 (2018) - [j13]Konstantin V. Vorob'ev, Ivan Yu. Mogilnykh, Alexandr Valyuzhenich:
Minimum supports of eigenfunctions of Johnson graphs. Discret. Math. 341(8): 2151-2158 (2018) - [i8]Ivan Yu. Mogilnykh:
A note on regular subgroups of the automorphism group of the linear Hadamard code. CoRR abs/1807.04446 (2018) - [i7]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On components of a Kerdock code and the dual of the BCH code C1, 3. CoRR abs/1810.04367 (2018) - [i6]Denis S. Krotov, Ivan Yu. Mogilnykh, Anastasia Yu. Vasil'eva:
On completely regular codes of covering radius 1 in the halved hypercubes. CoRR abs/1812.03159 (2018) - 2017
- [j12]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Propelinear codes related to some classes of optimal codes. Probl. Inf. Transm. 53(3): 251-259 (2017) - 2016
- [j11]Denis S. Krotov, Ivan Yu. Mogilnykh, Vladimir N. Potapov:
To the theory of q-ary Steiner and other-type trades. Discret. Math. 339(3): 1150-1157 (2016) - [j10]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On the symmetry group of the Mollard code. Probl. Inf. Transm. 52(3): 265-275 (2016) - [j9]Ivan Yu. Mogilnykh:
On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code. Probl. Inf. Transm. 52(3): 289-298 (2016) - 2015
- [j8]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Transitive nonpropelinear perfect codes. Discret. Math. 338(3): 174-182 (2015) - [j7]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On separability of the classes of homogeneous and transitive perfect binary codes. Probl. Inf. Transm. 51(2): 139-147 (2015) - [i5]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On maximum components of a class of perfect codes. CoRR abs/1512.03242 (2015) - [i4]Ivan Yu. Mogilnykh:
On the extention of propelinear structures of Nordstrom-Robinson code to Hamming code. CoRR abs/1512.03245 (2015) - 2014
- [j6]Alexander L. Gavrilyuk, Ivan Yu. Mogilnykh:
Cameron-Liebler line classes in PG(n, 4). Des. Codes Cryptogr. 73(3): 969-982 (2014) - 2013
- [j5]Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva:
On the Number of Nonequivalent Propelinear Extended Perfect Codes. Electron. J. Comb. 20(2): 37 (2013) - [c2]George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Rank spectrum of propelinear perfect binary codes. ISIT 2013: 879-881 - 2012
- [j4]Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva:
Structural properties of binary propelinear codes. Adv. Math. Commun. 6(3): 329-346 (2012) - [i3]George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Ranks of propelinear perfect binary codes. CoRR abs/1210.8253 (2012)
2000 – 2009
- 2009
- [j3]Ivan Yu. Mogilnykh:
On weak isometries of Preparata codes. Probl. Inf. Transm. 45(2): 145-150 (2009) - [j2]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inf. Theory 55(6): 2622-2625 (2009) - [i2]Ivan Yu. Mogilnykh:
On weak isometries of Preparata codes. CoRR abs/0902.2316 (2009) - 2008
- [c1]Sergey V. Avgustinovich, Ivan Yu. Mogilnykh:
Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). ICMCTA 2008: 11-19 - [i1]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs. CoRR abs/0810.5633 (2008) - 2007
- [j1]Ivan Yu. Mogilnykh:
On the regularity of perfect 2-colorings of the Johnson graph. Probl. Inf. Transm. 43(4): 303-309 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint