By Topic

A transform approach to permutation groups of cyclic codes over Galois rings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Blackford, J.T. ; Dept. of Math., Ohio State Univ., Columbus, OH, USA ; Ray-Chaudhuri, D.K.

Berger and Charpin (see ibid., vol.42, p.2194-2209, 1996 and Des., Codes Cuyptogr., vol.18, no.1/3, p.29-53, 1999) devised a theoretical method of calculating the permutation group of a primitive cyclic code over a finite field using permutation polynomials and a transform description of such codes. We extend this method to cyclic and extended cyclic codes over the Galois ring GR (pa, m), developing a generalization of the Mattson-Solomon polynomial. In particular, we classify all affine-invariant codes of length 2m over Z4 , thus generalizing the corresponding result of Kasami, Lin, and Peterson (1967) and giving an alternative proof to Abdukhalikov. We give a large class of codes over Z4 with large permutation groups, which include generalizations of Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Muller (RM) codes

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 7 )