By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 6 )