A class of multiple-error-correcting arithmetic residue codes

AN encoding in residue number systems allows construction of a class of nonlinear arithmetic error-correcting codes. The properties of these codes are further investigated and the redundancy necessary and sufficient to ensure multiple error correction is determined. An error-correcting procedure holding for codes using the minimal redundancy is presented. An error-correcting approach based upon the Euclidean algorithm is also reconsidered and it is shown that its redundancy requirements are lower than previously known.