Fast algorithms for erasures and error correction in redundant residue number systems

Abstract

In this work, we extend the coding theory approach to error control in redundant residue number systems (RRNS). The concept of erasure correction capability in RRNS is introduced. We derive the relationship between the minimum distance and the error detection and error/erasure correction capability. New computationally efficient algorithms are derived for simultaneously correcting single errors and multiple erasures and detecting multiple errors. These algorithms reduce the computational 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 need to process large valued integers is avoided.