scientific article; zbMATH DE number 1498828
A mapping \(\phi\: C\to F^n\) is called an isometry from a code \(C\) to the code \(\phi (C)\) if \(d(x,y) = d\bigl(\phi(x),\phi(y)\bigr)\) for all codewords \(x,y \in C\), where \(F\) is a finite alphabet of cardinality \(|F|=q\geq 2\). A code \(C\) in \(F^n\) is called metrically rigid if every isometry \(\phi\: C\to F^n\) with respect to the Hamming metric is extendable to an isometry of the whole space \(F^n\). The metrical rigidity of several classes of codes is established: (1) the binary even-weight code of length \(n\) is metrically rigid if and only if \(n\neq 4\); (2) \(q\)-ary \((q,2)\) and \((q+1,2)\) MDS codes are metrically rigid if and only if \(q=2\); (3) perfect codes with distance 3 are metrically rigid except the binary Hamming code of length 7 and the ternary Hamming code of length 4; (4) \(q\)-ary \((n,n-1)\) MDS codes are metrically rigid with few exceptions for codes of length 3 and 4; (5) every full constant-weight code is metrically rigid. For the entire collection see [Zbl 0918.00043].
- Rigid linear binary codes
- On the extendability of code isometries
- Werner Heise (1944--2013)
- To the metrical rigidity of binary codes
- On the metrical rigidity of binary codes
- scientific article; zbMATH DE number 1811346 (Why is no real title available?)
- Bounds for Robust Metering Schemes and Their Relationship with A2-code
- On perfect binary codes
- On metric rigidity for some classes of 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 Q4501019)
