Error Coding for Arithmetic Processors
Error Coding for Arithmetic Processors
Residue class error checking codes
ACM '61 Proceedings of the 1961 16th ACM national meeting
Biresidue Error-Correcting Codes for Computer Arithmetic
IEEE Transactions on Computers
Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System Design
IEEE Transactions on Computers
IBM Journal of Research and Development
| Hi-index | 14.98 |
Arithmetic codes use a structured redundancy technique for binary number representation such that errors in an arithmetic operation of a digital computer can be detected or corrected. This correspondence studies the code structures by treating the set of redundant coded binary representations as a finite Abelian group. An algebraic model of arithmetic codes is developed, which shows that an arithmetic code is a pair of cyclic group isomorphisms. Two theorems are derived which describe the necessary and sufficient conditions for the existence of an arithmetic code. It is also shown that the group of redundant coded binary numbers is isomorphic to a cyclic group, or the direct sum of two cyclic groups. For a given code generator A and the information cardinality m, the two theorems may be applied to find all existing arithmetic codes up to an isomorphism. The algebraic structures of all codes published to date are covered by the mathematical model described in this correspondence.