摘要
1、用另一种方法证明了C.L.Chen的一个定理; 2、证明了关于译BCH码而必须进行的迭代次数的下限的一个推测; 3、把对q元BCH码仅存在着差错时的泽码算法,推广到既有差错,又有疑符时的情况。
1) In this paper a C. L. Chen's theorem is proved with another approach. 2) A conjecture concerning the minimum number of iterations for decoding a BCH code has been proved. 3) Algorithm for decoding a q-ary BCH code with errors only is extended not only with errors but also with erasures.
出处
《天津商业大学学报》
1988年第2期1-9,22,共10页
Journal of Tianjin University of Commerce
