Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound

We present an erasure- and error decoding algorithm of one-point algebraic geometry codes up to the Feng-Rao designed distance using Sakata's (see Proceedings of the 1995 IEEE-ISIT, Whistler, Canada) multidimensional generalization of the Berlekamp-Massey algorithm and the voting procedure of Feng and Rao (1993).