By Topic

The trace operator and redundancy of 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
$33 $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

4 Author(s)
A. M. Roseiro ; Alcatel Espace, Courbevoie, France ; J. I. Hall ; J. E. Adney ; M. Siegel

The dimension of subfield subcodes and in particular generalized Goppa codes is studied using the kernel of an associated trace map. Bounds on the dimension for a particular general class of binary Goppa codes are obtained. Deeper study of some special cases and other related polynomials yields still tighter bounds for any s>1

Published in:

IEEE Transactions on Information Theory  (Volume:38 ,  Issue: 3 )