Constructions of low-degree and error-correcting ε-biased generators

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 33-45

  Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; DECODING; ENCODING (SYMBOLS); POLYNOMIAL APPROXIMATION;

BIASED GENERATOR; DECODING ALGORITHMS; DEGREE 2 GENERATORS; POLYNOMIAL TIME;

ERROR CORRECTION;

EID: 34247550388     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.15     Document Type: Conference Paper

References (32)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple construction of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-304, 1992.
2. M. Ajtai, H. Iwaniec, J. Komlos, J. Pintz, and E. Szemeredi. Construction of a thin set with small fourier coefficients. Bulletin of the London Mathematical Society, 22:583-590, 1990.
3. 0. In 45th annual FOCS, pages 166-175, 2004.
4. A. Ashikhmin, S. Litsyn, and M. A. Tsfasman. Asymptotically good quantum codes. Physical Review A, 63:0322311, 2001.
5. N. Alon and Y. Mansour. epsilon-discrepancy sets and their application for interpolation of sparse polynomials. Information Processing Letters, 54(6):337-342, 1995.
6. N. Alon and Y. Roichman. Random cayley graphs and expanders. Random Structures and Algorithms, 5(2):271-285, 1994.
7. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings of the 35th STOC, pages 612-621, 2003.
8. M. Cryan and P. B. Miltersen. On pseudo-random generators in NCO. In Proceedings of MFCS, 2001.
9. Y. Dodis and A. Smith. Correcting errors without leaking partial information. In Proceedings of the 37th Annual STOC, pages 654-663, 2005.
10. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic. Approximations of general independent distributions. In 24th annual STOC, pages 10-16, 1992.
11. J. Feigenbaum. The use of coding theory in computational complexity. In Different Aspects of Coding Theory, Proceedings of Symposia on Applied Mathematics, pages 207-233, 1995.
12. G. L. Feng and T. R. N. Rao. Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Transactions on Information Theory, 39(1):37-45, 1993.
13. O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(90), 2000.
14. O. Goldreich. Short locally testable codes and proofs (survey). Electronic Colloquium on Computational Complexity (ECCC), 5(14), 2000.
15. V. Guruswami. List decoding of error correcting codes. PhD thesis, MIT, 2001.
16. J. Håstad. One-way permutations in nc0. Infrmation Processing Letters, 26(3): 153-155, 1987.
17. J. Håstad, S. Phillips, and S. Safra. A well-characterized approximation problem. Information Processing Letters, 47(6):301-305, 1993.
18. M. Krause and S. Lucks. On the minimal hardware complexity of pseudorandom function generators. In 18th Annual STACS, pages 419-430, 2001.
19. A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and Quantum Computation. American Mathematical Society, 2002.
20. R. Matsumoto. Improvement of ashikhminlitsyn-tsfasman bound for quantum codes. IEEE Transactions on Information Theory, 48(7):2122-2124, 2002.
21. R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. JCSS, 49(3):478-516, 1994.
22. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, Part II. North-Holland, 1977.
23. 0. In 44th Annual FOCS, pages 136-145, 2003.
24. R. Meshulam and A. Wigderson. Expanders from symmetric codes. In 34th annual STOC, pages 669-677, 2002.
25. M. Naor. Constructing Ramsey graphs from small probability spaces. Technical report, IBM Research Report RJ 8810, 1992.
26. M. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge, 2000.
27. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. on Computing, 22(4):838-856, 1993.
28. R. Raz. Extractors with weak random seeds. In Proceedings of the 37th Annual STOC, pages 11-20, 2005.
29. A. A. Razborov, E. Szemerédi, and A. Wigderson. Constructing small sets that are uniform in arithmetic progressions. Combinatorics, Probability & Computing, 2:513-518, 1993.
30. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. JACM, 27(4):701-717, 1980.
31. L. Trevisan. Some applications of coding theory in computational complexity. Electronic Colloquium on Computational Complexity (ECCC), (043), 2004.
32. R. Zippel. Probabilistic algorithms for sparse polynomials. In Symbolic and algebraic computation, pages 216-226, 1979.