Chinese remaindering with errors

coordi- nates, then there exists a unique integer whose corresponding codesword differs from the corrupted word in at most places. Furthermore, Mandelbaum (25), (26) shows how can be recovered efficiently given the corrupted word provided that the 's are very close to one another. To deal with arbitrary 's, we present a variant of his algorithm that runs in almost linear time and recovers from errors. Our main contribution is an efficient decoding algorithm for the case in which the error may be larger than . Specif- ically, given residues and an agreement parameter , we find a list of all integers such that for at least values of , provided

[1]  Iwan M. Duursma,et al.  Decoding codes from curves and cyclic codes , 1993 .

[2]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[3]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[4]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[5]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[6]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  David M. Mandelbaum,et al.  Further Results on Decoding Arithmetic Residue COdeS , 1978 .

[8]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[9]  ChallengesPaul ZimmermannInria Lorrainezimmermann.  Polynomial Factorization , 1996 .

[10]  Peter Elias,et al.  Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[11]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[12]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[13]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[15]  Alexander Vardy,et al.  Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.

[16]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[17]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[18]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[19]  Kenneth J. Giuliani.  Factoring Polynomials with Rational Coeecients , 1998 .

[20]  David M. Mandelbaum,et al.  On a class of arithmetic codes and a decoding algorithm (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[21]  Piero Maestrini,et al.  Error Detection and Correction by Product Codes in Residue Number Systems , 1974, IEEE Transactions on Computers.

[22]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[23]  LundCarsten,et al.  Algebraic methods for interactive proof systems , 1992 .

[24]  D. Spielman,et al.  Expander codes , 1996 .

[25]  K. Y. Lin,et al.  Computational Number Theory and Digital Signal Processing: Fast Algorithms and Error Control Techniques , 1994 .

[26]  Paul Walton Purdom,et al.  The Analysis of Algorithms , 1995 .

[27]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[28]  Ronitt Rubinfeld,et al.  Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..

[29]  Ronitt Rubinfeld,et al.  Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[30]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[31]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[32]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[33]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[34]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[35]  Dana Ron,et al.  Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.

[36]  V. Wei,et al.  Error-Correcting Codes for List Decoding , 1994 .

[37]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[38]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[39]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[40]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[41]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[42]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[43]  Elwyn R. Berlekamp.  Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.

[44]  Amin Shokrollahi,et al.  Decoding algebraic-geometric codes beyond the error-correction bound , 1998, STOC '98.

[45]  R. W. Watson,et al.  Self-checked computation using residue arithmetic , 1966 .

[46]  Jin-Yi Cai,et al.  On the Hardness of Permanent , 1999, STACS.

[47]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[48]  Michael A. Soderstrand,et al.  Residue number system arithmetic: modern applications in digital signal processing , 1986 .

[49]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[50]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[51]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

[52]  Jin-Yi Cai,et al.  A Note on Enumarative Counting , 1991, Inf. Process. Lett..