It is known from[1] that using multiple subsets of consecutive syndromes

the coefficients of an error location polynomial may be obtained by solving a set of linear equations for the BCH codes with generalized bound. An iterative algorithm is introduced

which can compute a shortest-length linear shift-register that will generate multiple sequences. It generalizes the Berlekamp-Massey algorithm

and simplifies the finding of the coefficients of an error location polynomial for the BCH codes with generalized bound.