By Topic

Unique Decoding of General 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
$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

3 Author(s)
Kwankyu Lee ; Dept. of Math. & Educ., Chosun Univ., Gwangju, South Korea ; Bras-Amoros, M. ; O'Sullivan, M.E.

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed, regular structure, and direct message recovery. Upon this generalization, we add a technique from the Guruswami-Sudan list decoding that boosts the decoding speed significantly. Compared with other known decoding algorithms for general AG codes, it has a similar decoding performance and allows streamlined practical implementation by its simple and regular structure.

Published in:

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