Reconstructing curves in three (and higher) dimensional space from noisy data

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 136-142

  Coppersmith, Don ^a   Sudan, Madhu ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic Codes; Decoding Algorithm; Error correction; Maximum Distance Separable Codes; Random Errors

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); ERROR ANALYSIS; POLYNOMIALS;

RECONSTRUCTING CURVES;

DECODING;

EID: 0038447028     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780559.780563     Document Type: Conference Paper

References (6)

1. D. Bleichenbacher, A. Kiayias, and M. Yung. Manuscript, 2002.
2. V. Guruswami and P. Indyk. Expander-based constructions of efficiently decodable codes. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 658-667, Las Vegas, NV, October 2001.
3. V. Guruswami and P. Indyk. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 812-821, Montreal, Quebec, 19-21 May 2002.
4. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999.
5. A. Kiayiasand and M. Yung. Manuscript, 2002.
6. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.