Error Correction in Redundant Residue Number Systems

Stephen Sik Sang Yau, Yu Cheng Liu

Research output: Contribution to journalArticlepeer-review

60 Scopus citations


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 lookup, and hence their implementation needs 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 for single residue-error correction 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)
Pages (from-to)5-11
Number of pages7
JournalIEEE Transactions on Computers
Issue number1
StatePublished - Jan 1973
Externally publishedYes


  • 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
  • Computational Theory and Mathematics


Dive into the research topics of 'Error Correction in Redundant Residue Number Systems'. Together they form a unique fingerprint.

Cite this