- Full text PDF available (6)
- This year (0)
- Last five years (2)
Abstiuct-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. The Sakata algorithm is a generalization to N dimensions of the classical Berlekamp-Massey algorithm.
We present a decoding algorithm for algebraic-geometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patternes of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao and uses a modified version of Sakata's generalization of the Berlekamp-Massey algorithm.