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…