Content deleted Content added
rm technical, BCH coding is very technical, and remove "intro to study" tag, wikipedia is a reference not an educational work |
Photonique (talk | contribs) m Peterson Algorithm |
||
Line 48:
== Decoding ==
BCH decoding is split into the following 4 steps
# Calculate the 2t syndrome values, for the received vector R
# Calculate the error locator polynomials
# Calculate the roots of this polynomial, to get error ___location positions.
# If non-binary BCH, Calculate the error values at these error locations.
The following steps are illustrated below.
Suppose we receive a codeword vector '''r''' (the polynomial ''R''(''x'')).
Line 70 ⟶ 78:
''Original source (first two paragraphs) from [[Federal Standard 1037C]]''
[[Category:Error detection and correction]]
Popular decoding algorithms are,
# Peterson Gorenstein Zierler algorithm
==Peterson Gorenstein Zierler===
Petersons algorithm, is
<!-- # Berlekamp-Massey algorithm
==Berlekamp-Massey algorithm== -->
| |||