本文提出纠两个错的二元BCH码的代数完全译码方法。它实现起来比Hartmann的一步一步译码方法速度快,并且当对应校验子S_1、S_3的错误图样重量为3时,能找出所有对应同样校验子的重量为3的错误图样。同时,本文也建立了GF(2~m)上三次方程在GF(2~m)上有三个不同根的判别式,这在纠三个错的二元BCH码的完全译码中十分重要。 In this paper, we propose an algebraic complete decoding method to correct two wrong binary BCH codes. It performs faster than Hartmann’s step-by-step decoding method, and when the error pattern weight of the corresponding syndromes S_1, S_3 is 3, it can find all the error patterns with a weight of 3 corresponding to the same syndrome. At the same time, this paper also established the discriminant of three different roots on GF (2 ~ m) on GF (2 ~ m), which is very important in complete decoding of three wrong Binary BCH codes.