Decoding Reed Solomon Codes beyond the Error-Correction Diameter

We describe a new algorithm for the decoding of Reed Solomon codes. This algorithm was originally described in 12. While the algorithm presented in this article is the same, the presentation is somewhat diierent. In particular we derive more precise bounds on the performance of the algorithm and show the following: For an n; n; 1,n q Reed Solomon code, the algorithm in 12 corrects ,o1n errors in polynomial time, where = 1 , 1 1 + , k 2 where = $ r 2 + 1 4 , 1 2 : We also present the following two hopefully useful lower bounds on : 8 2 0; 11 1 , s 2 + 2 4 + 2 1 , p 2: