| 摘要 |
A multiple-solid-burst error correcting system determines the number and locations of "solid burst" errors in a high-rate Reed Solomon or BCH code by determining the greatest common divisor of the error locator polynomial sigma (x), which has roots alpha -ik that correspond to error locations ik, and a mapping error locator polynomial sigma ( alpha *x) that maps the error locations , ik, to locations ik+1. The roots that are common to both polynomials, that is, the roots that are included in the greatest common divisor, d(x), correspond to adjacent error locations that are contained in the solid bursts. The roots of the non-common factors, p1(x), of the error locator polynomial correspond to the first locations of the respective solid bursts and the roots of the non-common factors p2(x) of the mapping error locator polynomial correspond to one location beyond the end locations of the solid bursts. The system determines the roots of only the non-common factors to determine the locations that are included in the solid bursts. The system then labels all locations between associated first and last locations as part of a solid burst. If the error locator polynomial has degree "e" and the greatest common divisor has degree "d", the polynomials p1(x) and p2(x) each have degree e-d=p, which is equal to the number of solid bursts. The system finds the roots of the lower-degree p1(x), and uses p2(x) to test for the end locations of the bursts. |
