By Topic

On the number of correctable errors of the Feng-Rao decoding algorithm for AG 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)
Hao Chen ; Dept. of Math., Zhongshan Univ., Guangzhou, China

In this correspondence we give geometric codes on one of the curves of Garcia-Stichtenoth (1995) with the property that the true distances are bigger than Feng-Rao distances. Moreover, an example for which the Feng-Rao algorithm cannot correct more than [(dFR-1)/2]+1(<[(dtrue-1)/2]) errors is given

Published in:

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