New step-by-step decoding for binary BCH codes

A new efficient step-by-step decoding algorithm for terror -correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is presented, Based on logical analysis, we obtain a simple rule, which can directly determine whether any bit in received word is correct or not without finding the error-location polynomiaL The new method omits one largest-scale matrix calculation and the operations of multiplication are reduced significantly, compared with the conventional step-by-step decoding alg ori thm,