A branching control circuit for Berlekamp´s BCH decoding algorithm (Corresp.)

At each step in Berlekamp´s iterative algorithm for BCH codes, the decoder follows one of two possible branches. This correspondence presents a slight rephrasing of the algorithm for binary codes, which results in a very simple circuit for controlling the branching process. This circuit also performs all necessary tests on the validity of the resulting error-locator polynomial.