Issue No.03 - March (1975 vol.24)
P.G. Neumann , Computer Science Group, Stanford. Research Institute
This paper considers codes with radix r > 2 which are capable of correcting arbitrary arithmetic errors in any radix r digit. If each radix r digit represents a byte of b binary digits (e.g., r = 2<sup>b</sup>), these codes correct any combination of errors occurring in the b binary digits of any single byte. A theoretical basis for these codes is presented, along with practical considerations reg
AN codes, arithmetic codes, biresidue codes, byte-organized, gAN, low-cost residues, multiresidue codes, non-binary codes.
P.G. Neumann, T.R.N. Rao, "Error-Correcting Codes for Byte-Organized Arithmetic Processors", IEEE Transactions on Computers, vol.24, no. 3, pp. 226-232, March 1975, doi:10.1109/T-C.1975.224203