BCH code

A BCH (Bose-Chaudhuri-Hochquenghem) code is a multilevel, cyclic, error-correcting, variable-length digital code used to correct errors up to approximately 25% of the total number of digits.

Note: BCH codes are not limited to binary codes, but may be used with multilevel phase-shift keying whenever the number of levels is a prime number or a power of a prime number, such as 2, 3, 4, 5, 7, 8, 11, and 13. A BCH code in 11 levels has been used to represent the 10 decimal digits plus a sign digit.

BCH codes make use of field theory and polynomials over that field. The way the check polynomial is constructed provides the key to indicating that an error has occurred.

If we wish to construct a BCH code to detect and correct 2 errors we use the field GF(16) or Z₂[x]/<x⁴+x+1>

Now if we have α a root of x⁴+x+1, m₁(x)=x⁴+x+1. Now m₁ is minimal for α since

m₁(x)=(x-α)(x-α²)(x-α⁴)(x-α⁸)=x⁴+x+1.

If we wish to construct a code to correct 1 error we use m₁(x). Our codewords will be

C(x)≡0 (mod m₁(x))

which has roots α, α², α⁴, α⁸.

This does not allow us to choose many codewords - so we look for the minimal polynomial for the missing power of α from above - α³, and then the minimal polynomial for this is

m₃(x)=x⁴+x³+x²+x+1.

which has roots α, α⁶, α¹², α²⁴=&alpha⁹.

We take codewords having all of these as roots, so we form the polynomial

m_1,3(x)=m₁(x)m₃(x)=x⁸+x⁷+x⁶+x⁴+1

and take coodewords corresponding to polynomials of degree 14 such that

C(x)≡0 (mod m_1,3(x))

So now C(α)=C(α²)=...=C(α⁸)=0. (*)

Now in GF(16) we have 15 nonzero elements, and thus our polynomial will be of degree 14 with 8 check and 7 information bits - we have 8 check bits since we have (*).