BCH code: Difference between revisions

Content deleted Content added
m Formatting, Peterson algorithm
Line 79:
[[Category:Error detection and correction]]
 
==BCH Decoding algorithms==
 
Popular decoding algorithms are,
# Peterson Gorenstein Zierler algorithm
# Peterson Gorenstein Zierler Berlekamp-Massey algorithm
 
===Peterson Gorenstein Zierler Algorithm===
===Assumptions===
Petersons algorithm, is the step 2, of the generalized BCH decoding procedure. We use Peterson's algorithm, to calculate the error locator polynomial coefficients <math> \lambda_1 , \lambda_2 ... \lambda_{2t} </math>
of a polynomial
Line 92 ⟶ 93:
designed to correct <math>[t=\frac{d_{min}-1}{2}]</math> errors, is
 
== =Algorithm ===
* First generate the Matrix of <math>2t</math> syndromes,
* Next generate the <math>S_{txt}</math> matrix with the elements, Syndrome values,