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…