By Topic

Linear codes for single error correction in symmetric and asymmetric computational processes

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

2 Author(s)

A linear coding scheme for the correction of all possible single errors during arithmetic operations on binary number representations is discussed. The coded form of a number k is the binary representation of the number kt , where t is a positive integer. The code corrects all errors of the form \pm2^i , where i is less than n , the number of digits in the code words. The problem of determining the largest number k which may be encoded for a particular value of t is discussed. It is also shown that as the number of arithmetic operations to be performed increases, the use of this coding scheme becomes more significant in improving the reliability of the computational unit. An asymmetric process (in which only 1-errors or only O-errors are to be corrected) is also investigated and compared with the symmetric process.

Published in:

IRE Transactions on Information Theory  (Volume:8 ,  Issue: 1 )