Multi-Stage Robust Chinese Remainder Theorem
Li Xiao, Xiang-Gen Xia, and Wenjie Wang

TL;DR
This paper introduces a multi-stage robust Chinese Remainder Theorem (CRT) that improves error tolerance in reconstructing integers from erroneous remainders, extending robustness beyond previous limits through a multi-stage grouping approach.
Contribution
It presents a necessary and sufficient condition for robust reconstruction with general moduli and proposes a multi-stage grouping method to enhance error tolerance in the CRT.
Findings
Two-stage robust CRT can tolerate larger errors than traditional methods.
A grouping algorithm improves robustness in specific cases.
Multi-stage approach generalizes robustness beyond quarter of gcd error bound.
Abstract
It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large error in the reconstruction solution. A robust CRT was recently proposed for a special case when the greatest common divisor (gcd) of all the moduli is more than 1 and the remaining integers factorized by the gcd of all the moduli are co-prime. In this special case, a closed-form reconstruction from erroneous remainders was proposed and a necessary and sufficient condition on the remainder errors was obtained. It basically says that the reconstruction error is upper bounded by the remainder error level if is smaller than a quarter of the gcd of all the moduli. In this paper, we consider the robust reconstruction problem for a general set of moduli. We first present a necessary and sufficient condition for the remainder errors…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
