No label defined (Q4242209)

Let \(C\) be a perfect binary code with distance 3. In the graph \(G(C)\) of the minimum distances in \(C\), two vertices are defined to be adjacent if and only if their elementary codes lie at distance 3. Phelps and Le Van recently posed the question whether isomorphy of \(G(C_1)\) and \(G(C_2)\) implies that \(C_1\) and \(C_2\) are equivalent. A mapping \(f\: C_1 \to C_2\) is called a weak isometry provided that \(d(\alpha,\beta)=3\) if and only if \(d(f(\alpha),f(\beta))=3\). The positive answer to the above question follows from the following theorem. If two perfect binary \((n,3)\)-codes are weakly isometric then they are equivalent.