Decoding algebraic geometry codes by a key equation (Q1587770)

The paper deals with the decoding problem for general algebraic-geometric codes. Effective decoding can be done by solving key equations, generalizing ideas of Berlekamp-Mattey and Feng-Rao. A new decoding algorithm is proposed which improves both the decoding capacity and the complexity, with the only further assumption that there is an extra rational point on the curve which is not used in the construction of the algebraic-geometric codes. A central role is played by Duursma's majority coset scheme.