BCH code: Difference between revisions

Revision as of 01:17, 28 September 2019

Revision as of 01:19, 28 September 2019

Line 255:

===Factor error locator polynomial===

Now that you have the <math>\Lambda(x)</math> polynomial, its roots can be found in the form <math>\Lambda(x) = \left(\alpha^{i_1} x - 1\right) \left(\alpha^{i_2} x - 1\right) \cdots \left(\alpha^{i_v} x - 1\right)</math> by brute force for example using the [[Chien search]] algorithm. The exponential

powers of the primitive element <math>\alpha</math> will yield the positions where errors occur in the received word; hence the name 'error locator' polynomial.

The zeros of Λ(''x'') are ''α''^−''i''₁, ...…, ''α''^{−''i''_''v''}.

===Calculate error values===