A class of binary burst error-correcting quasi-cyclic codes
W. Zhang, Jack K. Wolf · IEEE Transactions on Information Theory · 1988
A class of binary quasi-cyclic burst error-correcting codes based upon product codes is studied. An expression for the maximum burst error-correcting capability for each code in the class is given. In certain cases, the 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. By shortening the codes, it is possible to design codes which achieve the Reiger bound.>