Konstantin Vorob'ev

From MaRDI portal
(Redirected from Konstantin Vorob'ev)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On binary codes with distances d and d+2
(available as arXiv preprint)
N/APaper
Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
(available as arXiv preprint)
N/APaper
On extended perfect codes
(available as arXiv preprint)
N/APaper
A new reducibility result for minihypers in finite projective geometries
Godishnik na Sofiĭskiya Universitet ``Sv. Kliment Okhridski. Fakultet po Matematika i Informatika
2026-03-20Paper
On binary codes with distances d and d+2
Designs, Codes and Cryptography
2025-10-30Paper
An upper bound on the size of a binary code with s distances
Doklady Bolgarskoĭ Akademii Nauk
2025-09-26Paper
Equitable 2-partitions of the Johnson graphs J(n,3)
Discrete Mathematics
2025-06-11Paper
On strong nodal domains for eigenfunctions of Hamming graphs
(available as arXiv preprint)
2025-01-01Paper
An upper bound on the size of a code with s distances
(available as arXiv preprint)
2025-01-01Paper
Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
Discrete Mathematics
2024-12-02Paper
\(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
Sibirskie Elektronnye Matematicheskie Izvestiya
2024-08-14Paper
Perfect 2‐colorings of Hamming graphs
Journal of Combinatorial Designs
2024-02-02Paper
Some results on the Wiener index related to the Šoltés problem of graphs
Discrete Applied Mathematics
2023-12-22Paper
On completely regular codes with minimum eigenvalue in geometric graphs
Discrete Mathematics
2023-05-15Paper
Constructions of binary codes with two distances
Discrete Mathematics
2023-04-20Paper
$L_{\infty}$ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs2023-04-03Paper
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
Discrete Applied Mathematics
2022-12-08Paper
On the palindromic Hosoya polynomial of trees
MATCH Communications in Mathematical and in Computer Chemistry
2022-11-17Paper
Equitable 2-partitions of the Johnson graphs J(n,3)2022-06-30Paper
On reconstruction of eigenfunctions of Johnson graphs
Discrete Applied Mathematics
2020-04-01Paper
On unbalanced Boolean functions with best correlation immunity
The Electronic Journal of Combinatorics
2020-03-30Paper
On unbalanced Boolean functions with best correlation immunity
The Electronic Journal of Combinatorics
2020-03-30Paper
Equitable 2-partitions of Johnson graphs with the second eigenvalue2020-03-24Paper
Equitable 2-partitions of Johnson graphs with the second eigenvalue
(available as arXiv preprint)
2020-01-01Paper
MMS-type problems for Johnson scheme
Sibirskie Elektronnye Matematicheskie Izvestiya
2019-05-09Paper
Minimum supports of functions on the Hamming graphs with spectral constraints
Discrete Mathematics
2019-03-25Paper
On unbalanced Boolean functions with best correlation immunity
(available as arXiv preprint)
2018-12-05Paper
Minimum supports of eigenfunctions of Johnson graphs
Discrete Mathematics
2018-06-07Paper
On reconstruction of eigenfunctions of Johnson graphs
(available as arXiv preprint)
2018-01-01Paper
On perfect 2-colorings of the hypercube
Sibirskie Elektronnye Matematicheskie Izvestiya
2015-11-16Paper
Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
Journal of Applied and Industrial Mathematics
2015-07-27Paper
Perfect multiple coverings of a hypercube2015-07-17Paper
Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph
Journal of Applied and Industrial Mathematics
2015-07-17Paper


Research outcomes over time


This page was built for person: Konstantin Vorob'ev