Title :
A class of binary burst error-correcting quasi-cyclic codes
Author :
Zhang, Wenlong ; Wolf, Jack Keil
Author_Institution :
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
fDate :
5/1/1988 12:00:00 AM
Abstract :
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
Keywords :
error correction codes; Gilbert codes; Reiger bound; binary codes; block length; burst error-correcting codes; product codes; quasi-cyclic codes; Error correction; Error correction codes; Fires; Helium; Magnetic recording; Military computing; Parity check codes; Product codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on