DocumentCode
1327660
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
Volume
34
Issue
3
fYear
1988
fDate
5/1/1988 12:00:00 AM
Firstpage
463
Lastpage
479
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.6026
Filename
6026
Link To Document