Skip to Main Content
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 is the binary representation of the number , where is a positive integer. The code corrects all errors of the form , where is less than , the number of digits in the code words. The problem of determining the largest number which may be encoded for a particular value of 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.