Konstantin Vorob’ev

collaborators

3 papers

math.CO2024

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…

math.CO2024

On binary codes with distances $d$ and $d + 2$

Ivan Landjev, Konstantin Vorob'ev

We consider the problem of finding $A_{2} (n, {d_{1}, d_{2}})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_{1}$ and $d_{2}$ . Binary codes wit…

math.CO2021

On the palindromic Hosoya polynomial of trees

Dmitry Badulin, Alexandr Grebennikov, Konstantin Vorob'ev

A graph $G$ on $n$ vertices of diameter $D$ is called $H$ -palindromic if $α (G, k) = α (G, D - k)$ for all $k = 0, 1, \dots, ⌊ \frac{D}{2} ⌋$ , where $α (G, k)$ is th…

Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs

On binary codes with distances d and d+2

On the palindromic Hosoya polynomial of trees

On binary codes with distances $d$ and $d + 2$