By Topic

Correction of synchronization errors with burst-error-correcting cyclic 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
$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)

It is shown that every linear cyclicb-burst-error-correcting code over any finite field can be modified to correct up to(b-2)symbols of synchronization slippage without additional redundancy, while maintaining its additive error-correcting capability in the absence of synchronization errors. For codes that are interleaved to a degreem, the synchronization error-correcting capability ism (b-1) - 1symbols, whereb geq 3is the length of the burst each subcode corrects. This technique gives an optimum burst-error-correcting code a synchronization error-corecfing capability that is only one symbol short of the known upper bound and is hence asymptotically optimal. Moreover, the implementation is very simple.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 1 )