On redundancy of strong isometries of binary codes

In this paper the notion of a semistrong isometry is introduced and it is proved that any such isometry between two binary codes is extendable to an isometry of the Boolean cube. This implies that any semistrong-isometric binary codes are equivalent. It is shown that these results has unimrovable character.