Affine invariant extended cyclic codes over Galois rings | IEEE Journals & Magazine | IEEE Xplore

Affine invariant extended cyclic codes over Galois rings


Abstract:

Recently, Blackford and Ray-Chaudhuri used transform domain techniques to permutation groups of cyclic codes over Galois rings. They used the same technique to find a set...Show More

Abstract:

Recently, Blackford and Ray-Chaudhuri used transform domain techniques to permutation groups of cyclic codes over Galois rings. They used the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length 2/sup m/ over any subring of GR(4,m) to be affine invariant. Here, we use the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length p/sup m/ over any subring of GR(p/sup e/,m) to be affine invariant, for e=2 with arbitrary p and for p=2 with arbitrary e. These are used to find two new classes of affine invariant Bose-Chaudhuri-Hocquenghem (BCH) and generalized Reed-Muller (GRM) codes over Z/sub 2//sup e/ for arbitrary e and a class of affine invariant BCH codes over Z/sub p//sup 2/ for arbitrary prime p.
Published in: IEEE Transactions on Information Theory ( Volume: 50, Issue: 4, April 2004)
Page(s): 691 - 698
Date of Publication: 30 March 2004

ISSN Information:

Related Articles are not available for this document.

Contact IEEE to Subscribe

References

References is not available for this document.