Decoding Algorithm for Binary BCH Codes

C.-L. Chr, S.-L. Su, and S.-W. Wu (Taiwan)


step-by-step decoding, binary BCH code, matrixcomputation, computational complexity.


A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional step by-step decoder is the "matrix-computing" element.

Important Links:

Go Back