To the metrical rigidity of binary codes (Q2487088): Difference between revisions

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.