By Topic

New classes of cyclic extended Goppa codes

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. ; Dept. de Math., Facultes des Sci. de Limoges, France

We give a condition for a “classical” Goppa (1970) code to have a cyclic extension. This condition follows from the properties of the semilinear automorphism group of the corresponding generalized Reed-Solomon codes. Using this condition, we can construct not only all the known Goppa codes with a cyclic extension, but also new families

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 4 )