By Topic

Burst-error correction for randomly-chosen binary group 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)

A method of burst-error correction is presented which works for a large class of codes. Any single burst of length up to somewhat less than one half the number of check digits can be corrected. The number of decoding computations per code word is proportional to the square of the code length for long codes. The code can be chosen in a random manner, except that several trials may sometimes be necessary in order to find a suitable code.

Published in:

Information Theory, IEEE Transactions on  (Volume:9 ,  Issue: 4 )