Multiple-burst error-correcting cyclic product codes (Corresp.)
W. van Overveld · IEEE Transactions on Information Theory · 1987
LetCbe the cyclic product code ofpsingle parity check codes of relatively prime lengthsn_{1}, n_{2},\cdots , n_{p} (n_{1} < n_{2} < \cdots < n_{p}). It is proven thatCcan correct2^{P-2}+2^{p-3}-1bursts of lengthn_{1}, andlfloor(\max\{p+1, \min\{2^{p-s}+s-1,2^{p-s}+2^{p-s-1}\}\}-1)/2\rfloorbursts of lengthn_{1}n_{2} \cdots n_{s} (2\leq s \leq p-2). Forp=3this means thatCis double-burst-n_{1}-correcting. An efficient decoding algorithm is presented for this code.