By Topic

Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

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

3 Author(s)
Sakata, S. ; Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan ; Jensen, H.E. ; Hoholdt, T.

We treat a general class of algebraic-geometric codes and show how to decode these up to half the Feng-Rao bound, using an extension and modification of the Sakata algorithm (1990). The Sakata algorithm is a generalization to N dimensions of the classical Berlekamp-Massey algorithm

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 6 )