Abstract

It is well known that the success of an error code is greatly dependent on the effectiveness of its error correcting procedures. As far as residue codes are concerned, the decoding procedures should consist of simple, unambiguous and modular computations. The past literature shows that this goal can be attained only at the expenses of an additional redundancy and provided that the error multiplicity is limited to a single error occurrence. In this paper, it will be shown that a new definition of the error syndrome permits to reconsider preceding results in order to obtain, without using any supplementary redundancy, unambiguous and fast correcting procedures holding for errors of arbitrary multiplicity.

Author Keywords: Arithmetic codes; Parallel algorithms; Residue number systems; Safety/security in digital systems; Syndrome decoding

Article Outline

• References