|
Problemy Peredachi Informatsii, 2011, Volume 47, Issue 1, Pages 19–32
(Mi ppi2034)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Coding Theory
On metric rigidity for some classes of codes
D. I. Kovalevskaya Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk
Abstract:
A code $C$ in the $n$-dimensional metric space $\mathbb F^n_q$ over the Galois field $GF(q)$ is said to be metrically rigid if any isometry $I\colon C\to\mathbb F^n_q$ can be extended to an isometry (automorphism) of $\mathbb F^n_q$. We prove metric rigidity for some classes of codes, including certain classes of equidistant codes and codes corresponding to one class of affine resolvable designs.
Received: 23.04.2010 Revised: 10.12.2010
Citation:
D. I. Kovalevskaya, “On metric rigidity for some classes of codes”, Probl. Peredachi Inf., 47:1 (2011), 19–32; Problems Inform. Transmission, 47:1 (2011), 15–27
Linking options:
https://www.mathnet.ru/eng/ppi2034 https://www.mathnet.ru/eng/ppi/v47/i1/p19
|
Statistics & downloads: |
Abstract page: | 283 | Full-text PDF : | 80 | References: | 40 | First page: | 10 |
|