On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes (Q4371889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1106484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes |
scientific article; zbMATH DE number 1106484 |
Statements
On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes (English)
0 references
26 April 1998
0 references
BCH decoding
0 references
errors-and-erasures decoding
0 references
0.7904924154281616
0 references
0.7688939571380615
0 references
0.766618013381958
0 references
0.7631114721298218
0 references
This paper presents an efficient algorithm for successive errors-and-erasures decoding of BCH codes. The algorithm constructs all the associated error locator and error evaluator polynomials and chooses one pair based on a new acceptance criterion. This criterion is only slightly more stringent than Forney's criterion for generalized minimum distance (GMD) decoding. A lower bound is given on the difference of these acceptance criteria. The ability to choose the most appropriate error locator polynomial means that a candidate codeword can be obtained by computing the roots of only one polynomial. As a consequence, the total number of finite field calculations required is only slightly higher than that required by standard algebraic decoding (hard-decision decoding). The paper also presents an example and some performance results. These results show that the performance of the new algorithm is slightly inferior to that of GMD decoding, but the computational complexity is much lower.
0 references