To the metrical rigidity of binary codes (Q2487088): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Sergei V. Avgustinovich / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Faina I. Solov'eva / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1025148221096 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1511606937 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | To the metrical rigidity of binary codes |
scientific article |
Statements
To the metrical rigidity of binary codes (English)
0 references
17 August 2005
0 references
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.
0 references
binary codes
0 references
metrical rigidity
0 references