Better extractors for better codes?

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 436-444

  Guruswami, Venkatesan ^a  

^a University of Washington   (United States)

Author keywords

Error correcting codes; Expander graphs; List decoding; Pseudorandomness; Randomness extractors

Indexed keywords

ACOUSTIC NOISE; ALGORITHMS; DECODING; GRAPH THEORY; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ERROR-CORRECTING CODES; EXPANDER GRAPHS; LIST DECODING; RANDOMNESS EXTRACTORS;

COMPUTATIONAL COMPLEXITY;

EID: 4544262873     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007422     Document Type: Conference Paper

References (20)

1. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, and Ronny Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38:509-516, 1992.
2. Noga Alon, Jeff Edmonds and Michael Luby. Linear time erasure codes with nearly optimal recovery. Proceedings of FOCS'95, pages 512-519.
3. Venkatesan Guruswami. List Decoding of Error-Correcting Codes. Ph.D thesis, Massachusetts Institute of Technology, August 2001.
4. Venkatesan Guruswami, Johan Håstad, Madhu Sudan, and David Zuckerman. Combinatorial Bounds for List Decoding. IEEE Transactions on Information Theory, 48(5):1021-1035, May 2002.
5. Venkatesan Guruswami and Piotr Indyk. Expander-based constructions of efficiently decodable codes. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, October 2001, pages 658-667.
6. Venkatesan Guruswami and Piotr Indyk. Near-optimal Linear-Time Codes for Unique Decoding and New List-Decodable Codes Over Smaller Alphabets. Proceedings of STOC'02, pages 812-821.
7. Venkatesan Guruswami and Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999.
8. Venkatesan Guruswami and Madhu Sudan. List decoding algorithms for certain concatenated codes. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 181-190, 2000.
9. Jaikumar Radhakrishnan and Amnon Ta-Shma. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM Journal on Discrete Mathematics, 13(1):2-24, 2000.
10. Ronen Shaltiel. Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS, 77:67-95, 2002.
11. Ronen Shaltiel and Christopher Umans. Simple extractors for all min-entropies and a new pseudo-random generator. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, October 2001, pages 648-657.
12. Madhu Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
13. Madhu Sudan. List decoding: Algorithms and applications. SIGACT News, 31:16-27, 2000.
14. Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2): 236-266, March 2001.
15. Aravind Srinivasan and David Zuckerman. Computing with Very Weak Random Sources. SIAM J. Comput., 28(4): 1433-1459, 1999.
16. Amnon Ta-Shma and David Zuckerman. Extractor Codes. IEEE Transactions on Information Theory, to appear. Preliminary version appears in the Proceedings of the 33rd Annual A CM Symposium on Theory of Computing, pages 193-199, July 2001.
17. Amnon Ta-Shma and David Zuckerman. Extractor Codes. IEEE Transactions on Information Theory, to appear. Preliminary version appears in the Proceedings of the 33rd Annual A CM Symposium on Theory of Computing, pages 193-199, July 2001.
18. Amnon Ta-Shma, David Zuckerman, and Shmuel Safra. Extractors from Reed-Muller codes. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, October 2001, pages 638-647.
19. Luca Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4): 860-879, 2001.
20. P Minimization Problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 465-474, 1999.