By Topic

Some classes of multiple-burst-error-correcting codes using threshold decoding

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 class of quasi-cyclic multiple-burst-error-correcting codes are constructed in which threshold decoding is used. These codes resemble the interlaced self-orthogonal quasi-cyclic random-error-correcting codes constructed by Townsend and Weldon, but the interlacing depends on the parity-check equations used. These parity-check equations are based on difference triangles that were introduced by Robinson and Bernstein in connection with convolutional codes. A restriction on these codes is that the maximum error burst length allowable is a multiple of a subperiod n_o of the codes. It is shown that in many cases these codes have shorter length than the equivalent interlaced random-error-correcting quasi-cyclic codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:18 ,  Issue: 2 )