ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED{SOLOMON CODES
Sergey I. Egorov, Garik Markarian · 2003
A modication of Blahut procedure is proposed for error correction beyond the conventional error bound for ReedSolomon codes. An eectiv e method is oered 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)(nt)) 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. K e y w o r d s: error correcting codes, Reed-Solomon codes, Berlekamp-Massey algorithm, Blahut procedure