Almost euclidean subspaces of Ell; N 1 via expander codes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 353-362

  Guruswami, Venkatesan ^a   Lee, James R ^a   Razborov, Alexander ^b,c  

^a University of Washington   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANDER CODES; EXPANSION PROPERTIES; LOWER BOUNDS; POLYNOMIAL-TIME;

ARTIFICIAL INTELLIGENCE; CONTROL THEORY; INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

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

References (36)

1. N. Alon and F. R. K. Chung. Explicit construction of linear sized tolerant networks. In Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, pages 15-19, 1988.
2. S. Artstein-Avidan and V. D. Milman. Logarithmic reduction of the level of randomness in some probabilistic geometric constructions. J. Fund. Anal., 235(1):297-329, 2006.
3. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. SIAM Journal on Computing, 36(4):1095-1118, 2006.
4. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proceedings of the 46th ACM Symposium on Theory of Computing, pages 1-10, 2005.
5. P. J. Cameron and J. J. Seidel. Quadratic forms over GF(2). Indag. Math., 35:1-8, 1973.
6. M. R. Capalbo, O. Reingold, S. P. Vadhan, and A. Wigderson. Randomness conductors and constantdegree lossless expanders. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 659-668, 2002.
7. R. A. DeVore. Deterministic constructions of compressed sensing matrices. Manuscript, 2007.
8. D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52:1289-1306, 2006.
9. D. L. Donoho and P. B. Stalk. Uncertainty principles and signal recovery. SIAM J. Appl. Math., 49(3):906-931, 1989.
10. P. Erdös. A theorem of Sylvester and Schur. J. London Math. Soc., 9:282-288, 1934.
11. T. Figiel, J. Lindenstrauss, and V. D. Milman. The dimension of almost spherical sections of convex bodies. Acta Math., 139(1-2):53-94, 1977.
12. R. G. Gallager. Low-Density Parity-Check Codes. MIT Press, 1963.
13. A. Garnaev and E. D. Gluskin. The widths of Euclidean balls. Doklady An. SSSR., 277:1048-1052, 1984.
14. V. Guruswami, C. Umans, and S. P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 96-108, 2007.
15. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.), 43(4):439-561, 2006.
16. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of the ACM, 53(3):307-323, 2006.
17. P. Indyk. Explicit constructions for compressed sensing of sparse signals. To appear, 19th Annual Symposium on Discrete Algorithms, 2007.
18. 2 In Proceedings of the 39th Annual ACM Symposium on the Theory of Computing, pages 615-620, 2007.
19. p. In Handbook of the geometry of Banach spaces, Vol. I, pages 837-870. North-Holland, Amsterdam, 2001.
20. B. S. Kashin. The widths of certain finite-dimensional sets and classes of smooth functions. Izv. Akad. Nauk SSSR Ser. Mat., 41(2):334-351, 478, 1977.
21. B. S. Kashin and V. N. Temlyakov. A remark on compressed sensing. Available at http://www.dsp.ece.rice.edu/cs/KT2007.pdf, 2007.
22. A. M. Kerdock. A class of low-rate nonlinear binary codes. Inform. Control, 20:182-187, 1972.
23. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
24. S. Lovett and S. Sodin. Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. Electronic Colloquium on Computational Complexity, Report TR07-012, 2007.
25. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
26. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977.
27. V. Milman. Topics in asymptotic geometric analysis. Geom. Fund. Anal., (Special Volume, Part II):792-815, 2000. GAFA 2000 (Tel Aviv, 1999).
28. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math., 13(1):2-24 (electronic), 2000.
29. W. Rudin. Trigonometric series with gaps. J. Math. Mech., 9:203-227, 1960.
30. G. Schechtman. Random embeddings of Euclidean spaces in sequence spaces. Israel J. Math., 40(2):187-192, 1981.
31. C. Schütt. Entropy numbers of diagonal operators between symmetric Banach spaces. J. Approx. Theory, 40(2):121-128, 1984.
32. M. Sipser and D. A. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42(6, part 1):1710-1722, 1996. Codes and complexity.
33. S. Szarek. Convexity, complexity, and high dimensions. In International Congress of Mathematicians. Vol. II, pages 1599-1621. Eur. Math. Soc., Zürich, 2006.
34. R. M. Tanner. A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5):533-547, 1981.
35. T. Tao and V. Vu. Additive combinatorics, volume 105 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2006.
36. G. Zémor. On expander codes. IEEE Transactions on Information Theory, 47(2):835-837, 2001.