Fast decoding of algebraic-geometric codes up to the designed minimum distance
Shojiro Sakata, JØrn Justesen, Y. Madelung, Helge Elbrond Jensen, Tom Høholdt · IEEE Transactions on Information Theory · 1995
We present a decoding algorithm for algebraic-geometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patterns of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao (1993) and uses a modified version of Sakata's (1988) generalization of the Berlekamp-Massey algorithm.