一类纠二元突发错的准循环码的译码算法

A class of binary burst error-correcting quasi-cyclic codes

介绍了一种基于二维乘积码的一类纠二元突发错的准循环码及其最大纠突发错能力,并提出了一种译码算法.在一定条件下,这类码可化为循环Gilbert码.经常这类码比具有相同码长和校验位的Gilbert码可纠更长的突发错.计算机模拟表明,所提出的译码算法可行.

A class of binary quasi-cyclic burst error-correcting codes based upon product codes is introduced.An expression for the maximum burst error-correcting capability for each code in the class is given.A decoding algorithm for the class of codes is set forth.In certain cases the codes reduce to Gilbert codes,which are cyclic.Often codes exist in the class which have the same block length and number of check bits as the Gilbert codes but correct longer bursts of errors than Gilbert codes.Computer simulation shows that the decoding algorithm works well.