Error correction in redundant residue number systems

S. S. Yau, Y. C. Liu

Research output: Contribution to conferencePaperpeer-review


In this paper, two error-correcting algorithms for redundant residue number systems are presented, one for single residue-error correction and the other for burst residue-error correction. Neither algorithm requires table look-up and hence their implementations need a memory space which is much smaller than that required by existing methods. Furthermore, the conditions which the moduli of the redundant residue number systems must satisfy in these two algorithms are less restrictive than that of existing methods. Comparison of the approach on which these two algorithms are based and that of existing methods is given.

Original languageEnglish (US)
StatePublished - 1972
Externally publishedYes
Event2nd IEEE Symposium on Computer Arithmetic, ARITH 1972 - College Park, United States
Duration: May 15 1972May 16 1972


Conference2nd IEEE Symposium on Computer Arithmetic, ARITH 1972
Country/TerritoryUnited States
CityCollege Park


  • Algorithms
  • Burst residue-errors
  • Conditions for moduli
  • Error correction
  • Memory requirement
  • Redundant residue number systems
  • Single residue-errors
  • Speed

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Error correction in redundant residue number systems'. Together they form a unique fingerprint.

Cite this