By Topic

On linear residue codes for burst-error correction

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)

Linear residue codes are useful for error control in both arithmetic operations and data transmission. When used in data transmission, they do not require special coding equipment, as encoding and decoding operations may be easily carried out in digital computers. In this paper, number-theoretic concepts are used to construct linear residue codes for the correction of burst errors. A general theory is developed for the class of codes derived from the multiplicative group G(A) modulo A , an odd integer, which consists of all the integers smaller than and relatively prime to A . Construction schemes for various classes of burst-error-correcting binary linear residue codes are determined and discussed.

Published in:

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