A Robust Generalized Chinese Remainder Theorem for Two Integers

DOI10.1109/TIT.2016.2614322MaRDI QIDQ2976468zbMATH OpenFDO

Authors X.-G. Xia, Wenjie Wang, Wei Wang, Xiaoping Li

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.03277

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Abstract: A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A robust CRT has also been proposed lately for robustly reconstruct a single integer from its erroneous remainders. In this paper, we consider the reconstruction problem of two integers from their residue sets, where the remainders are not only out of order but also may have errors. We prove that two integers can be robustly reconstructed if their remainder errors are less than $M/8$, where $M$ is the greatest common divisor (gcd) of all the moduli. We also propose an efficient reconstruction algorithm. Finally, we present some simulations to verify the efficiency of the proposed algorithm. The study is motivated and has applications in the determination of multiple frequencies from multiple undersampled waveforms.

Cited in

(5)

• A novel secret sharing scheme using multiple share images
• scientific article; zbMATH DE number 3963911 (Why is no real title available?)
• On Solving a Generalized Chinese Remainder Theorem in the Presence of Remainder Errors
• Simplification on dynamic range of a generalized Chinese remainder theorem for multiple integers
• Generalization of the Chinese remainder theorem

This page was built for publication: A Robust Generalized Chinese Remainder Theorem for Two Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976468)