On the tau-reconstruction of Reed-Solomon codes using affine plane curves


Lancelot Pecquet
INRIA, projet CODES
BP 105
78153 Le Chesnay Cedex, France
Lancelot.Pecquet@inria.fr

International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-VI
Pskov, Russia, 1998

Abstract

We present an analysis of Sudan's list-decoding algorithm for Reed-Solomon codes. We give an upper bound on the size of the returned list derived from Sudan's conditions and propose an inprovement in step two of the decoding algorithm.

Keywords

Sudan's algorithm, list-decoding, Newton iterations.