Abstarct

This paper studies and classifies linear transformations that connect Hamming distances of codes. These include irreducible linear transformations and their concatenations. Their effect on the Hamming weights of codewords is also studied. Both linear and non-linear codes over fields are considered. We construct a family of pure binary quantum codes using these transformations. It is shown that optimal codes can be constructed using these transformations.