By Topic

On the existence of optimum cyclic burst- correcting codes

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
$33 $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

4 Author(s)

It is shown that for each integer b \geq 1 infinitely many optimum cyclic b -burst-correcting codes exist, i.e., codes whose length n , redundancy r , and burst-correcting capability b , satisfy n = 2^{r-b+1} - 1 . Some optimum codes for b = 3, 4 , and 5 are also studied in detail.

Published in:

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