GitHub

chinese_remainder_theorem.py

If GCD(a,b) = 1, then for any remainder ra modulo a and any remainder rb modulo b there exists integer n, such that n = ra (mod a) and n = ra(mod b). If n1 and n2 are ...
IEEE

An Energy Balance-aware Event Query Algorithm based on Chinese Remainder Theorem

Abstract: We discuss the use of the Chinese Remainder Theorem for a novel query scheme in wireless sensor networks. Unfixed location events and queries in wireless sensor networks have drawn ...
IEEE

Maximum Likelihood Estimation Based Complex-Valued Robust Chinese Remainder Theorem and Its Fast Algorithm

Abstract: In this paper, we investigate complex-valued Chinese remainder theorem (C-CRT) with erroneous remainders, where the moduli are Gaussian integers and the errors follow wrapped complex ...