Multiple-burst error-correcting cyclic product codes (Corresp.)

Let
C
be the cyclic product code of
p
single parity check codes of relatively prime lengths
n_{1}, n_{2},\cdots , n_{p} (n_{1} < n_{2} < \cdots < n_{p})
. It is proven that
C
can correct
2^{P-2}+2^{p-3}-1
bursts of length
n_{1}
, and
lfloor(\max\{p+1, \min\{2^{p-s}+s-1,2^{p-s}+2^{p-s-1}\}\}-1)/2\rfloor
bursts of length
n_{1}n_{2} \cdots n_{s} (2\leq s \leq p-2)
. For
p=3
this means that
C
is double-burst-
n_{1}
-correcting. An efficient decoding algorithm is presented for this code.