Decoding binary two-error correcting cyclic codes with Zech logarithms
P.C. Stevens, Harold N. Ward · IEEE Transactions on Communications · 1992
A decoding method for binary two-error correcting cyclic codes whose generator polynomials have at most two irreducible factors is presented. This class includes binary narrow-sense BCH codes with designed distance 5. The decoding algorithm uses the Zech logarithm for the finite field in which the roots of the code lie.>