To the metrical rigidity of binary codes
Let \(C\) be a binary code in the \(n\)-dimensional matric space \(E^n\) over \(\mathbb{F}_2\) equipped with the Hamming metric. The code \(C\) is called metrically rigid if each isometry \(I: C\to E^n\) can be extended to an isometry of the whole space \(E^n\). The metrically rigid code \(C\) is called strongly rigid if each code in \(E^n\) containing \(C\) is metrically rigid. The author studies binary codes induced by \(2\)-\((n,k,\lambda)\) designs, where a \(2\)-\((n,k,\lambda)\) design is a set \({\mathcal B}\) of \(k\)-subsets of \(N= \{1,2,\dots, n\}\) such that any unordered pair of elements of \(N\) is contained in exactly \(\lambda\) sets of \({\mathcal B}\). His main result then is that the code of a \(2\)-\((n,k,\lambda)\) design with \(n\geq k^4\) extended by the zero-codeword is strongly rigid.
- Isometry groups of combinatorial codes
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
- On the metrical rigidity of binary codes
- scientific article; zbMATH DE number 1811346 (Why is no real title available?)
- scientific article; zbMATH DE number 1498828 (Why is no real title available?)
- Isometry groups of combinatorial codes
- MacWilliams extension theorem for MDS codes over a vector space alphabet
- On perfect binary codes
This page was built for publication: To the metrical rigidity of binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487088)
