Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650949 | Discrete Mathematics | 2006 | 10 Pages |
Abstract
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 investigated. Both linear and non-linear codes over fields are considered. We construct optimal linear codes and a family of pure binary quantum codes using these transformations.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David G. Glynn, T. Aaron Gulliver, Manish K. Gupta,