13 citations · 17 across the 4 of their papers we have counts for
4 papers
On the number of nonequivalent propelinear extended perfect codes
J. Borges, I. Yu. Mogilnykh, J. Rifà +1
The paper proves that there exist an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that al…
Ranks of propelinear perfect binary codes
George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva
It is proven that for any numbers n=2^m-1, m >= 4 and r, such that n - log(n+1)<= r <= n excluding n = r = 63, n = 127, r in {126,127} and n = r = 2047 there exists a propelinear p…
On weak isometries of Preparata codes
Ivan Yu. Mogilnykh
Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called weakly isometric, if there exists a mapping J:C1->C2, such that for any x,y from C1 the equality d(x,y)=d ho…
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs
Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen +1
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A cons…