Published in

Elsevier, Discrete Mathematics, 16(306), p. 1871-1880, 2006

DOI: 10.1016/j.disc.2006.03.068

Links

Tools

Export citation

Search in Google Scholar

Linear transformations on codes

Journal article published in 2006 by David Gerald Glynn, T. Aaron Gulliver, T. Aaron Gulliver, Manish K. Gupta ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

The paper studies and classifies linear transformations that connect Hamming distances of codes. The transformations include irreducible linear transformations and their concatenations. The effect on the Hamming weights of codewords is investigated. In addition, the authors apply the irreducible transformations to obtain many optimal codes. A class of binary additive quantum codes of distance at most 3 is constructed.