Error Codes for Arithmetic Operations

This paper classifies error correcting codes for arithmetic and provides the necessary and sufficient conditions for the various code classes. Particular attention is given to the arithmetic properties of the codes. It is shown that the Brown codes and the Henderson codes are examples of a general class of nonseparate, nonsystematic codes. Henderson's systematic code is shown to be the only systematic, nonseparate code. Finally, conditions are given for the existence of code classes for both radix complement and diminished radix complement coded arithmetic systems.

[1]  David T. Brown.  Error Detecting and Correcting Binary Codes for Arithmetic Operations , 1960, IRE Trans. Electron. Comput..

[2]  Harvey L. Garner,et al.  Generalized Parity Checking , 1958, IRE Trans. Electron. Comput..

[3]  W. W. Peterson.  On Checking an Adder , 1958, IBM J. Res. Dev..

[4]  D. S. Henderson.  Residue class error checking codes , 1961, ACM National Meeting.

[5]  Harvey L. Garner.  A Ring Model for the Study of Multiplication for Complement Codes , 1959, IRE Trans. Electron. Comput..