Extractor codes

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 3015-3025

  Ta Shma, Amnon ^a   Zuckerman, David ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HARVARD UNIVERSITY   (United States)

^c University of Texas at Austin   (United States)

Author keywords

Extractor codes; Extractors; Hardcore bits; Johnson bound; List decoding; Reed Solomon codes; Soft decision decoding

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; POLYNOMIALS; SPURIOUS SIGNAL NOISE;

EXTRACTOR CODES; HARDCORE BITS; JOHNSON BOUND; LIST DECODING; REED-SOLOMON CODES; SOFT DECISION DECODING;

CODES (SYMBOLS);

EID: 10644226110     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.838377     Document Type: Article

References (42)

1. V. Guruswami, "Better extractors for better codes?," in Proc. 36th Annual ACM Symp. Theory of Computing, 2004, pp. 436-444.
2. P. Elias, "List decoding for noisy channels," in 1957-IRE WESCON Conv. Rec., 1957, pp. 94-104.
3. J. M. Wozencraft, "List decoding," in Quarterly Progress Report, 1958, vol. 48, MIT Research Laboratory of Electronics, pp. 90-95.
4. O. Goldreich and L. A. Levin, "A hard-core predicate for all one-way functions," in Proc. 21st Annu. ACM Symp. Theory of Computing, 1989, pp. 25-32.
5. M. Sudan, "Decoding of Reed Solomon codes beyond the error-correction bound," J. Complexity, vol. 13, no. 1, pp. 180-193, 1997.
6. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1757-1767, Sept. 1999.
7. D. Boneh, "Finding smooth integers in short intervals using CRT decoding," in Proc. 32nd Annu. ACM Symp. Theory of Computing, 2000, pp. 265-272.
8. M. Sudan, "Coding theory: Tutorial and survey," in Proc. 42nd Annu. IEEE Symp. Foundations of Computer Science, 2001, pp. 36-53.
9. V. Guruswami and P. Indyk, "Near-optimal linear time codes for unique decoding and new list-decodable codes over smaller alphabets," in Proc. 34th Annu. ACM Symp. Theory of Computing, 2002, pp. 812-821.
10. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comput. Sys. Sci., vol. 52, no. 1, pp. 43-52, 1996.
11. D. Zuckerman, "Randomness-optimal oblivious sampling," Random Structures and Algorithms, vol. 11, pp. 345-367, 1997.
12. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR lemma," in Proc. 31st Annu. ACM Symp. Theory of Computing 1999, pp. 537-546.
13. A. Wigderson and D. Zuckerman, "Expanders that beat the eigenvalue bound: Explicit construction and applications," Combinatorica, vol. 19, no. 1, pp. 125-138, 1999.
14. M. Sipser, "Expanders, randomness, or time vs. space," J. Comput. Syst. Sci., vol. 36, pp. 379-383, 1988.
15. D. Zuckerman, "On unapproximable versions of NP-complete problems," SIAM J. Computing, vol. 25, pp. 1293-1304, 1996.
16. E. Mossel and C. Umans, "On the complexity of approximating the VC dimension," in Proc. 16th Annu. IEEE Conf. Computational Complexity 2001, pp. 220-225.
17. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bull. Europ. Assoc. for Theor. Comput. Sci., vol. 77, pp. 67-95, June 2002.
18. N. Nisan, "Extracting randomness: How and why - A survey," in Proc. 11th Annu. IEEE Conf. Computational Complexity, 1996, pp. 44-58.
19. N. Nisan and A. Ta-Shma, "Extracting randomness: A survey and new constructions," J. Comput. Syst. Sci., vol. 58, pp. 148-173, 1999.
20. S. M. Johnson, "A new upper bound for error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-8, pp. 203-207, Apr. 1962.
21. L. Trevisan, "Extractors and pseudorandom generators," J. ACM, pp. 860-879, 2001.
22. G. D. Forney, Jr., "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
23. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 49, pp. 2809-2825, Nov. 2003.
24. V. Guruswami, A. Sahai, and M. Sudan, "Soft-decision decoding of Chinese remainder codes," in Proc. 41st Annu. IEEE Symp. Foundations of Computer Science, 2000, pp. 159-168.
25. O. Goldreich, R. Rubinfeld, and M. Sudan, "Learning polynomials with queries: The highly noisy case," SIAM J. Discr. Math., Vol. 13, pp. 535-570, 2000.
26. E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes," IEEE Tran. Inform. heory, vol. 46, pp. 2373-2395, Nov. 2000.
27. J. Radhakrishnan, private communication, 1997.
28. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudorandom generation from one-way functions," in Proc. 21st Annu. ACM Symp. Theory of Computing, 1989, pp. 12-24.
29. J. Radhakrishnan and A. Ta-Shma, "Bounds for dispersers, extractors, and depth-two superconcentrators," SIAM J. Discr. Math., vol. 13, no. 1, pp. 2-24, 2000.
30. R. Shaltiel and C. Umans, "Simple extractors for all min-entropies and a new pseudo-random generator," in Proc. 42nd Annu. IEEE Symp. Foundations of Computer Science, 2001, pp. 648-657.
31. A. Ta-Shma, "Storing information with extractors," Inform. Processing Lett., vol. 83, no. 5, pp. 267-274, 2002.
32. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh, " Are bitvectors optimal?," in Proc. 32nd Annu. ACM Symp. Theory of Computing, 2000, pp. 449-458.
33. R. Impagliazzo and D. Zuckerman, "How to recycle random bits," in Proc. 30th Annu. IEEE Symp. Foundations of Computer Science, 1989, pp. 248-253.
34. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Trans. Inform. Theory, vol. 48, pp. 1021-1034, May 2002.
35. J. Savage, Models of Computation. Reading, MA: Addison-Wesley, 1998.
36. N. Nisan and A. Wigderson, "Hardness vs. randomness," J. Comput. Syst. Sci., vol. 49, pp. 149-167, 1994.
37. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, "Bpp has subexponential simulation unless Exptime has publishable proofs," Comput. Complexity, vol. 3, pp. 307-318, 1993.
38. R. Impagliazzo and A. Wigderson, "P = BPP if E requires exponential circuits: Derandomizing the XOR lemma," in Proc. 29th Annu. ACM Symp. Theory of Computing, 1997, pp. 220-229.
39. R. Raz, O. Reingold, and S. Vadhan, "Extracting all the randomness and reducing the error in Trevisan's extractors," in Proc. 31st Annu. ACM Symp. Theory of Computing, 1999, pp. 149-158.
40. V. Guruswami and M. Sudan, "List decoding algorithms for certain concatenated codes," in Proc. 32nd Annu. ACM Symp. Theory of Computing, 2000, pp. 181-190.
41. R. Impagliazzo, private communication, 1997.
42. M. Sudan, "List decoding: Algorithms and applications," in SIGACT News, vol. 31, Mar. 2000, pp. 16-27.