Decoding of codes defined by a single point on a curve

A decoding algorithm for certain codes from algebraic curves is presented. The dual code, which is used for decoding, is formed by evaluating rational functions having poles at a single point. A theoretical foundation is developed from which an improved bound for the minimum distance and results on decoding up to that bound are derived. The decoding is done by a computationally efficient Berlekamp-Massey type algorithm, which is intrinsic to the curve.