13 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.IT2009★ 3 cited
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…
cs.IT2008★ 13 cited
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…