A code C in the n-dimensional metric space E n over GF(2) is called metrically rigid if each isometry I : C → E n can be extended to an isometry of the whole space E n . For n large enough, metrical rigidity of any length-n binary code that contains a 2-(n, k, λ)-design is proved. The class of such codes includes, for instance, all families of uniformly packed codes of large enough lengths that satisfy the condition d − ρ ≥ 2, where d is the code distance and ρ is the covering radius.
Problems of Information Transmission – Springer Journals
Published: Oct 3, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud