New decoder for double-error-correcting binary BCH codes

A step-by-step decoding algorithm is presented for double-error-correcting binary BCH codes of length n=2^m-1. The decoding algorithm can directly determine whether any received bit is correct or not without knowing the number of errors which have occurred in the received vector and also without determining the corresponding error location polynomial. The merits of the hardware decoder based on the algorithm are that it is very simple and fast. In addition, it is suitable for decoding long block codes