Tree decoding of BCH codes

The most time consuming step in the decoding of BCH codes is the calculation of the error locator polynomial. This is done using an iterative algorithm or direct solution which is often computationally expensive. By performing a simple check on which syndromes are zero, many decoding failures can be detected before the polynomial is calculated. In this paper, tree diagrams for decoding are constructed based on these checks