Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
Shojiro Sakata, D.A. Leonard, Helge Elbrond Jensen, Tom Høholdt · IEEE Transactions on Information Theory · 1998
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.