scientific article; zbMATH DE number 1285452
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.
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- The minimum distance of graph codes
- On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
- On the minimum distance graph of an extended Preparata code
- On binary cyclic codes with minimum distance d=3.
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Hamiltonicity of minimum distance graphs of 1-perfect codes
- Binary codes from graphs on triples and permutation decoding
- Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs
- On isometry of close-packed binary codes
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
- On the minimum distance graph of an extended Preparata code
- STS-graphical invariant for perfect codes
- scientific article; zbMATH DE number 1811346 (Why is no real title available?)
- scientific article; zbMATH DE number 17837 (Why is no real title available?)
- Extremal 1-codes in distance-regular graphs of diameter 3
- scientific article; zbMATH DE number 2165228 (Why is no real title available?)
- On perfect binary codes
- On weak isometries of preparata codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242209)
