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

摘要

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