By Topic

On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) 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
$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

1 Author(s)
John J. Metzner ; Pennsylvania State Univ., University Park

In this communication, simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operations. One result is that any (n, k) cyclic code with minimum distance > 2 can correct all full vector symbol error bursts of length n-k-1 or less if the error vectors are linearly independent. If the bursts are not full but contain some error-free components, the capability of correcting bursts up to n-k or less is code dependent. Also, vector symbol decoding with Reed-Solomon component codes can correct, very simply, with probability ges 1- n(n - k)2-r, all cases of e les n - k - 1 r-bit random errors in any cyclic span of length les n - k. The techniques often work when there is linear dependence. In cases where most errors are in a burst but a small number of errors are outside, the solution, given error-correcting capability, can be broken down into a simple solution for the small number of outside errors, followed by a simple subtraction to reveal all the error values in the burst part.

Published in:

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