By Topic

Goppa and related codes invariant under a prescribed permutation

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

1 Author(s)
Berger, T.P. ; UFR des Sci. de Limoges, France

We explain how to construct Goppa codes, expurgated or extruded Goppa codes invariant under a permutation induced by an element of the projective semilinear group PΓL(2, GF (pm)). This follows from the knowledge of semilinear automorphism groups of generalized Reed-Solomon codes. We obtain very good codes: some of them have parameters which reach the values given in the Brouwer table (see Handbook of Coding Theory, V.S. Pless and W.C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, vol.1, ch.4., 1998).. Moreover, it is easy to construct quasi-cyclic Goppa or related codes. Often, we obtain parameters unknown for quasi-cyclic codes

Published in:

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