ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED-SOLOMON CODES

Sergey Egorov - Garik Markarian

   A modification of Blahut procedure is proposed for error correction beyond the conventional error bound for Reed-Solomon codes. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q-1)n/((n+t+1)(n-t)) times compared to Blahut procedure. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed procedure is shown for some practical codes.

Keywords: Reed-Solomon codes

[full-paper]