| 发明名称 |
Apparatus for detecting uncorrectable error patterns when using Euclid's algorithm to decode Reed-Solomon (BCH) codes |
| 摘要 |
A Reed-Solomon Galois Field Euclid algorithm decoder determines whether an error is uncorrectable by checking for: I. deg [ LAMBDA (x))]</=t II. deg [ OMEGA (x)]<deg[ LAMBDA (x)] III. All roots of LAMBDA (x) are in GF(qm) IV. Roots of LAMBDA (x) are distinct V. LAMBDA (x) has no roots at 0 VI. S(x) LAMBDA (x)== OMEGA (x) mod x2t An error in a received Reed Solomon message may be uncorrectable. An error is correctable only when each of the six conditions are met. Any error which fails to meet these six criteria cannot be corrected It is important to users of such encoded data that they are aware that an error is contained therein which is uncorrectable. Because it has only recently been proven that failure to meet these criteria in fact is the result of an uncorrectable error. No prior art Reed Solomon decoder checks to determine whether these criteria are in fact met. Many of these criteria are checked by implication as the normal result of calculating through Euclid's algorithm.
|
| 申请公布号 |
US5099482(A) |
申请公布日期 |
1992.03.24 |
| 申请号 |
US19890400447 |
申请日期 |
1989.08.30 |
| 申请人 |
IDAHO RESEARCH FOUNDATION, INC. |
发明人 |
CAMERON, KELLY |
| 分类号 |
H03M13/15 |
主分类号 |
H03M13/15 |
| 代理机构 |
|
代理人 |
|
| 主权项 |
|
| 地址 |
|
