Chinese remaindering with errors

Oded Goldreich, Dana Ron, Madhu Sudan

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)1330-1338
Number of pages9
JournalIEEE Transactions on Information Theory
Volume46
Issue number4
DOIs
StatePublished - Jul 2000

Fingerprint

Dive into the research topics of 'Chinese remaindering with errors'. Together they form a unique fingerprint.

Cite this