Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
Shojiro Sakata, Helge Elbrond Jensen, Tom Høholdt · IEEE Transactions on Information Theory · 1995
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.