Editing BCH code (section)

===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 ''α''<sup>−''i''<sub>1</sub></sup>, …, ''α''<sup>−''i''<sub>''v''</sub></sup>.