Affine invariant extended cyclic codes over Galois rings

Dey, B. K. ; Rajan, B. S. (2004) Affine invariant extended cyclic codes over Galois rings IEEE Transactions on Information Theory, 50 (4). pp. 691-698. ISSN 0018-9448

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/1278670/

Related URL: http://dx.doi.org/10.1109/TIT.2004.825044

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 2m 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 pm over any subring of GR(pe,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 Z2e for arbitrary e and a class of affine invariant BCH codes over Zp2 for arbitrary prime p.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:107794
Deposited On:08 Dec 2017 10:13
Last Modified:08 Dec 2017 10:13

Repository Staff Only: item control page