By Topic

Fast erasure-and-error decoding of algebraic geometry codes up to 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

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

This article gives an errata (that is erasure- and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao (1994) designed minimum distance using Sakata's (see Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, BC, Canada, 1995) multidimensional generalization of the Berlekamp-Massey (1969) algorithm and the voting procedure of Feng and Rao

Published in:

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