@article{6fe3539df27a4c5281f25a50328e9310,
title = "Chinese remaindering with errors",
abstract = "An efficient decoding algorithm for the Chinese Remainder Theorem is presented. The algorithm recovers the message even when the amount of agreement between the 'received word' and the 'codeword' is much smaller than the number of errors.",
author = "Oded Goldreich and Dana Ron and Madhu Sudan",
note = "Funding Information: Manuscript received July 7, 1999; revised February 10, 2000. The work of O. Goldreich was done in part while visiting MIT, and was supported in part by DARPA under Grant DABT63-96-C-0018. The work of D. Ron was done in part while visiting MIT, supported by an ONR Science Scholar Fellowship of the Bunting Institute. The work of M. Sudan was supported in part by a Sloan Foundation Fellowship, an MIT-NEC Research Initiation Grant, and NSF CAREER Award CCR-9875511. An extended abstract of this paper appeared in Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, May 1–4, 1999, pp. 225–234.",
year = "2000",
month = jul,
doi = "10.1109/18.850672",
language = "אנגלית",
volume = "46",
pages = "1330--1338",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",
}