Split group codes
Kohel, David R.
Date of Issue2000
School of Physical and Mathematical Sciences
We construct a class of codes of length n such that the minimum distance d outside of a certain subcode is, up to a constant factor, bounded below by the square root of n, a well-known property of quadratic residue codes. The construction, using the group algebra of an Abelian group and a special partition or splitting of the group, yields quadratic residue codes, duadic codes, and their generalizations as special cases. We show that most of the special properties of these codes have analogues for split group codes, and present examples of new classes of codes obtained by this construction.
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
IEEE transactions on information theory
© 2000 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/18.825811].