FAST ALGORITHMS FOR ERASURES AND ERROR-CORRECTION IN REDUNDANT RESIDUE NUMBER-SYSTEMS

In this work, we extend the coding theory approach to error control in redundant residue number systems (RRNS). The concept of erasure corre ction capability in RRNS is introduced. We derive the relationship bet ween the minimum distance and the error detection and error/erasure co rrection capability. New computationally efficient algorithms are deri ved for simultaneously correcting single errors and multiple erasures and detecting multiple errors. These algorithms reduce the computation al complexity of the previously known algorithms by at least an order of magnitude. Another attractive feature of the algorithms is that all the arithmetic operations are modulo operations. Consequently, the ne ed to process large valued integers is avoided.