DocumentCode :
916244
Title :
Single- and multiple-burst-correcting properties of a class of cyclic product codes
Author :
Bahl, Lalit R. ; Chien, Robert T.
Volume :
17
Issue :
5
fYear :
1971
fDate :
9/1/1971 12:00:00 AM
Firstpage :
594
Lastpage :
600
Abstract :
The direct product of 
single parity-check codes of block lengths 
is a cyclic code of block length 
with 
information symbols per block, if the integers 
are relatively prime in pairs. A lower bound for the single-burst-correction (SBC) capability of these codes is obtained. Then, a detailed analysis is made for 
, and it is shown that the codes can correct one long burst or two short bursts of errors. A lower bound for the double-burst-correction (DBC) capability is derived, and a simple decoding algorithm is obtained. The generalization to correcting an arbitrary number of bursts is discussed.
single parity-check codes of block lengths is a cyclic code of block length with information symbols per block, if the integers are relatively prime in pairs. A lower bound for the single-burst-correction (SBC) capability of these codes is obtained. Then, a detailed analysis is made for , and it is shown that the codes can correct one long burst or two short bursts of errors. A lower bound for the double-burst-correction (DBC) capability is derived, and a simple decoding algorithm is obtained. The generalization to correcting an arbitrary number of bursts is discussed.Keywords :
Burst-correcting codes; Cyclic codes; Product codes; Contracts; Convolutional codes; Decoding; Information theory; Magnetic recording; NASA; Parity check codes; Product codes; State estimation; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054690
Filename :
1054690
Link To Document :
