On the list and bounded distance decodibility of Reed-Solomon codes (extended abstract)

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 335-341

  Cheng, Qi ^a   Wan, Daqing ^b,c  

^a University of Oklahoma   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CURVE FITTING; ENCODING (SYMBOLS); ERROR CORRECTION; PROBLEM SOLVING; THEOREM PROVING;

CODEWORDS; DISCRETE LOGARITHM; HAMMING DISTANCE; REED-SOLOMON CODE;

CODES (SYMBOLS);

EID: 17744398068     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Agrawal, N. Kayal, and N. Saxena. Primes is in P. http://www.cse.iitk. ac.in/news/primality.pdf, 2002.
2. E. Berlekamp and L. Welch. Error correction of algebraic block codes. U.S. Patent Number 4633470, 1986.
3. Daniel Bleichenbacher and Phong Q. Nguyen. Noisy polynomial interpolation and noisy Chinese remaindering. In Proceedings of EuroCrypto, volume 1807 of Lecture Notes in Computer Science, 2000.
4. F.R.K. Chung. Diameters and eigenvalues. Journal of American Mathematical Society, 2(2):187-196, 1989.
5. Peter Elias. List decoding for noisy channels. In 1957-IRE WESCON Convention Record, pages 94-104, 1957.
6. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning polynomials with queries: the highly noisy case. SIAM Journal on Discrete Mathematics, 2000.
7. V. Guruswami. Limits to list decodability of linear codes. In Proc. 34th ACM Symp. on Theory of Computing, 2002.
8. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5): 1021-1034, 2002.
9. Venkatesan Guruswami and Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory, 45(6): 1757-1767, 1999.
10. Jorn Justesen and Tom Hoholdt. Bounds on list decoding of MDS codes. IEEE Transactions on Information Theory, 47(4):1604-1609, 2001.
11. Nicholas M. Katz. Factoring polynomials in finite fields: an application of Lang-Weil to a problem in graph theory. Mathematische Annalen, 286:625-637, 1990.
12. Aggelos Kiayias and Moti Yung. Cryptographic hardness based on the decoding of Reed-Solomon codes. In Proceedings of ICALP, volume 2380 of Lecture Notes in Computer Science, 2002.
13. A. M. Odlyzko. Discrete logarithms: The past and the future. Designs, Codes, and Cryptography, 19:129-145, 2000.
14. Carl Pomerance. Fast, rigorous factorization and discrete logarithm algorithms. In Discrete Algorithms and Complexity. Academic Press, 1987.
15. Madhu Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
16. Madhu Sudan. Coding theory: Tutorial & survey. In Proc. 42th IEEE Symp. on Foundations of Comp. Science, pages 36-53, 2001.
17. J. F. Voloch. On some subgroups of the multiplicative group of finite rings. http://www.ma.utexas.edu/users/voloch/preprint.html, 2003.
18. Daqing Wan. Generators and irreducible polynomials over finite fields. Mathematics of Computation, 66(219): 1195-1212, 1997.