On the minimum distance graph of an extended Preparata code (Q2638424)

Let \(C\) be a binary code of length \(n\) and minimum distance \(d\). The minimum distance graph \(DG\) of \(C\) is the graph whose vertices are the codewords of \(C\), where two vertices are adjacent if and only if the corresponding codewords are at distance \(d\) apart. The Preparata code is a binary nonlinear distance invariant code of length \(2^m-1\), \(m\) even, \(m \geq 4\), and minimum distance \(5\), and its extended Preparata code of length \(n=2^m\) is denoted by \(P(m)\), which has minimum distance \(6\). The main result of this paper is to show that the minimum distance graph of extended Preparata codes \(P(m)\), \(m \geq 6\), uniquely determines the code up to equivalence. Alternatively, the distance graphs of two extended Preparata codes of length at least \(64\) are isomorphic if and only if the codes are equivalent.