Decoding of one-point codes using error evaluator polynomials
Michael E. O’Sullivan · 2002
The author amends the decoding algorithm developed previously which generalizes the Berlekamp-Massey algorithm to a broad class of algebraic geometry codes called one-point codes. The Berlekamp-Massey algorithm and its generalization both produce a set of error locator polynomials which are then used to find the positions where the errors occurred. In the case of Reed-Solomon codes, the algorithm may be modified to also calculate an error evaluator polynomial.