To the Metrical Rigidity of Binary Codes

A code C in the n-dimensional metric space En over GF(2) is called metrically rigid if each isometry I : C → En can be extended to an isometry of the whole space En. 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.