By Topic

Bounds on Goppa codes (Corresp.)

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)

Goppa showed that the performance of most "Goppa codes" approaches the Gilbert bound asymptotically, but their performance for moderate lengths has not previously been demonstrated. In this correspondence, lower bounds are obtained on the minimum distance of most binary Goppa codes of any length.

Published in:

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