一种至少k－2位正确的捕错译码

AN ERROR-TRAPPING DECODING WITH AT LEST k-2 BITS

当ｘ２＋ｘ＋１不是ｇ（ｘ）的因子，ｇ（ｘ）和（ｘ２＋ｘ＋１）ｇ（ｘ）分别是二元线性循环码ｃ（ｘ）和Ｃｓｕｂ（ｘ）的生成多项式时，则Ｃｓｕｂ（ｘ）是ｃ（ｘ）的子码．恰当选用ｃ（ｘ）／Ｃｓｕｂ（ｘ）的４个余式ｃ（ｘ）转换为子码，然后对子码捕错．当错误矢量Ｅ（ｘ）的重量Ｗ［Ｅ（ｘ）］≤ｔ，且有连续ｋ位为零时，就能正确译码．

Assume that (x2+x+1) is not an irreducible factor of g(x),g(x) and (x2+x+1)g(x) are generator polynomials of linear cyclic codes,c(x) and csub(x) over GF(2) respectively,then csub(x) is subcode of the c(x). Selecting 4 redundant factories of the c(x)/csub(x) properly,transfering c(x) into subcode form and error-trapping decoding for them, the decoding process can be performed correctly only if the weight, W[E],of the error vector,E(x),is not larger than t and there exist k- 2consecutive zeros. This decoding technique not only improves the error correcting ability, but also can get the output of the sortting decoding form with easy implementation.