{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T23:12:22Z","timestamp":1771369942578,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00493-010-2463-9","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T11:08:06Z","timestamp":1284635286000},"page":"47-68","source":"Crossref","is-referenced-by-count":11,"title":["Almost Euclidean subspaces of \u2113 1 N VIA expander codes"],"prefix":"10.1007","volume":"30","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]},{"given":"James R.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Razborov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"issue":"1\u20133","key":"2463_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-5060(08)70766-0","volume":"72","author":"N. Alon","year":"1988","unstructured":"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), and Discrete Math. 72(1\u20133) (1988), 15\u201319.","journal-title":"Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), and Discrete Math"},{"issue":"1","key":"2463_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.jfa.2005.11.003","volume":"235","author":"S. Artstein-Avidan","year":"2006","unstructured":"S. Artstein-Avidan and V. D. Milman: Logarithmic reduction of the level of randomness in some probabilistic geometric constructions, J. Funct. Anal. 235(1) (2006), 297\u2013329.","journal-title":"J. Funct. Anal"},{"issue":"4","key":"2463_CR3","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1137\/S0097539705447141","volume":"36","author":"B. Barak","year":"2006","unstructured":"B. Barak, R. Impagliazzo and A. Wigderson: Extracting randomness using few independent sources, SIAM Journal on Computing 36(4) (2006), 1095\u20131118.","journal-title":"SIAM Journal on Computing"},{"key":"2463_CR4","doi-asserted-by":"crossref","unstructured":"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\u201310, 2005.","DOI":"10.1145\/1060590.1060592"},{"issue":"1","key":"2463_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00039-004-0451-1","volume":"14","author":"J. Bourgain","year":"2004","unstructured":"J. Bourgain, N. Katz and T. Tao: A sum-product estimate in finite fields, and applications; Geom. Funct. Anal. 14(1) (2004), 27\u201357.","journal-title":"Geom. Funct. Anal"},{"issue":"2","key":"2463_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S1631-073X(03)00281-4","volume":"337","author":"J. Bourgain","year":"2003","unstructured":"J. Bourgain and S. V. Konyagin: Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order, C. R. Math. Acad. Sci. Paris 337(2) (2003), 75\u201380.","journal-title":"C. R. Math. Acad. Sci. Paris"},{"key":"2463_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/1385-7258(73)90014-0","volume":"35","author":"P. J. Cameron","year":"1973","unstructured":"P. J. Cameron and J. J. Seidel: Quadratic forms over GF(2), Indag. Math. 35 (1973), 1\u20138.","journal-title":"Indag. Math"},{"key":"2463_CR8","doi-asserted-by":"crossref","unstructured":"M. R. Capalbo, O. Reingold, S. P. Vadhan and A. Wigderson: Randomness conductors and constant-degree lossless expanders, in: Proceedings of the 34th ACM Symposium on Theory of Computing, pages 659\u2013668, 2002.","DOI":"10.1145\/509907.510003"},{"key":"2463_CR9","doi-asserted-by":"crossref","unstructured":"R. A. DeVore: Deterministic constructions of compressed sensing matrices, Manuscript, 2007.","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"2463_CR10","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. L. Donoho","year":"2006","unstructured":"D. L. Donoho: Compressed sensing, IEEE Transactions on Information Theory 52 (2006), 1289\u20131306.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2463_CR11","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/0149053","volume":"49","author":"D. L. Donoho","year":"1989","unstructured":"D. L. Donoho and P. B. Stark: Uncertainty principles and signal recovery, SIAM J. Appl. Math. 49(3) (1989), 906\u2013931.","journal-title":"SIAM J. Appl. Math"},{"key":"2463_CR12","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1112\/jlms\/s1-9.4.282","volume":"9","author":"P. Erd\u0151s","year":"1934","unstructured":"P. Erd\u0151s: A theorem of Sylvester and Schur, J. London Math. Soc. 9 (1934), 282\u2013288.","journal-title":"J. London Math. Soc"},{"issue":"1\u20132","key":"2463_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02392234","volume":"139","author":"T. Figiel","year":"1977","unstructured":"T. Figiel, J. Lindenstrauss and V. D. Milman: The dimension of almost spherical sections of convex bodies, Acta Math. 139(1\u20132) (1977), 53\u201394.","journal-title":"Acta Math"},{"key":"2463_CR14","doi-asserted-by":"crossref","unstructured":"R. G. Gallager: Low-Density Parity-Check Codes, MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"2463_CR15","first-page":"1048","volume":"277","author":"A. Garnaev","year":"1984","unstructured":"A. Garnaev and E. D. Gluskin: The widths of Euclidean balls, Doklady An. SSSR. 277 (1984), 1048\u20131052.","journal-title":"Doklady An. SSSR"},{"key":"2463_CR16","doi-asserted-by":"crossref","unstructured":"V. Guruswami, J. Lee and A. Wigderson: Euclidean sections of with sublinear randomness and error-correction over the reals, in: 12th International Wrokshop on Randomization and Combinatorial Optimization: Algorithms and Techniques (RANDOM), pages 444\u2013454, 2008.","DOI":"10.1007\/978-3-540-85363-3_35"},{"key":"2463_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013108, 2007.","DOI":"10.1109\/CCC.2007.38"},{"issue":"4","key":"2463_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"S. Hoory, N. Linial and A. Wigderson: Expander graphs and their applications, Bull. Amer. Math. Soc. (N.S.) 43(4) (2006), 439\u2013561.","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"issue":"3","key":"2463_CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/1147954.1147955","volume":"53","author":"P. Indyk","year":"2006","unstructured":"P. Indyk: Stable distributions, pseudorandom generators, embeddings, and data stream computation; Journal of the ACM 53(3) (2006), 307\u2013323.","journal-title":"Journal of the ACM"},{"key":"2463_CR20","doi-asserted-by":"crossref","unstructured":"P. Indyk: Uncertainty principles, extractors, and explicit embeddings of L 1 into L 2; in: Proceedings of the 39th Annual ACM Symposium on the Theory of Computing, pages 615\u2013620, 2007.","DOI":"10.1145\/1250790.1250881"},{"key":"2463_CR21","unstructured":"P. Indyk: Explicit constructions for compressed sensing of sparse signals, in: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 30\u201333, 2008."},{"key":"2463_CR22","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/S1874-5849(01)80021-8","volume-title":"Handbook of the geometry of Banach spaces","author":"W. B. Johnson","year":"2001","unstructured":"W. B. Johnson and G. Schechtman: Finite dimensional subspaces of Lp, in: Handbook of the geometry of Banach spaces, Vol. I, pages 837\u2013870, North-Holland, Amsterdam, 2001."},{"issue":"2","key":"2463_CR23","first-page":"334","volume":"41","author":"B. S. Kashin","year":"1977","unstructured":"B. S. Kashin: The widths of certain finite-dimensional sets and classes of smooth functions, Izv. Akad. Nauk SSSR Ser. Mat. 41(2) (1977), 334\u2013351, 478.","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat"},{"issue":"5\u20136","key":"2463_CR24","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1134\/S0001434607110193","volume":"82","author":"B. S. Kashin","year":"2007","unstructured":"B. S. Kashin and V. N. Temlyakov: A remark on compressed sensing, Math. Notes 82(5\u20136) (2007), 748\u2013755. Available at http:\/\/dsp.rice.edu\/files\/cs\/KT2007.pdf .","journal-title":"Math. Notes"},{"key":"2463_CR25","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A. M. Kerdock","year":"1972","unstructured":"A. M. Kerdock: A class of low-rate nonlinear binary codes, Inform. Control 20 (1972), 182\u2013187.","journal-title":"Inform. Control"},{"issue":"2","key":"2463_CR26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London and Y. Rabinovich: The geometry of graphs and some of its algorithmic applications, Combinatorica 15(2) (1995), 215\u2013245.","journal-title":"Combinatorica"},{"issue":"4","key":"2463_CR27","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1142\/S0219199708002879","volume":"10","author":"S. Lovett","year":"2008","unstructured":"S. Lovett and S. Sodin: Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits, Commun. Contemp. Math. 10(4) (2008), 477\u2013489.","journal-title":"Commun. Contemp. Math"},{"issue":"3","key":"2463_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs, Combinatorica 8(3) (1988), 261\u2013277.","journal-title":"Combinatorica"},{"key":"2463_CR29","unstructured":"F. J. MacWilliams and N. J. A. Sloane: The Theory of Error-Correcting Codes, North-Holland, 1977."},{"key":"2463_CR30","unstructured":"V. Milman: Topics in asymptotic geometric analysis, Geom. Funct. Anal. Special Volume, Part II (2000), 792\u2013815. GAFA 2000 (Tel Aviv, 1999)."},{"issue":"1","key":"2463_CR31","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"J. Radhakrishnan and A. Ta-Shma: Bounds for dispersers, extractors, and depth-two superconcentrators; SIAM J. Discrete Math. 13(1) (2000), 2\u201324 (electronic).","journal-title":"SIAM J. Discrete Math"},{"key":"2463_CR32","first-page":"203","volume":"9","author":"W. Rudin","year":"1960","unstructured":"W. Rudin: Trigonometric series with gaps, J. Math. Mech. 9 (1960), 203\u2013227.","journal-title":"J. Math. Mech"},{"issue":"2","key":"2463_CR33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02761909","volume":"40","author":"G. Schechtman","year":"1981","unstructured":"G. Schechtman: Random embeddings of Euclidean spaces in sequence spaces, Israel J. Math. 40(2) (1981), 187\u2013192.","journal-title":"Israel J. Math"},{"issue":"2","key":"2463_CR34","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0021-9045(84)90021-2","volume":"40","author":"C. Sch\u00fctt","year":"1984","unstructured":"C. Sch\u00fctt: Entropy numbers of diagonal operators between symmetric Banach spaces, J. Approx. Theory 40(2) (1984), 121\u2013128.","journal-title":"J. Approx. Theory"},{"issue":"6part1","key":"2463_CR35","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"M. Sipser and D. A. Spielman: Expander codes, IEEE Trans. Inform. Theory 42(6, part 1) (1996), 1710\u20131722. Codes and complexity.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2463_CR36","first-page":"1599","volume":"II","author":"S. Szarek","year":"2006","unstructured":"S. Szarek: Convexity, complexity, and high dimensions; in: International Congress of Mathematicians, Vol. II, pages 1599\u20131621, Eur. Math. Soc., Z\u00fcrich, 2006.","journal-title":"International Congress of Mathematicians"},{"issue":"5","key":"2463_CR37","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R. M. Tanner","year":"1981","unstructured":"R. M. Tanner: A recursive approach to low complexity codes, IEEE Transactions on Information Theory 27(5) (1981), 533\u2013547.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2463_CR38","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive combinatorics","author":"T. Tao","year":"2006","unstructured":"T. Tao and V. Vu: Additive combinatorics, volume 105 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 2006."},{"issue":"2","key":"2463_CR39","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/18.910593","volume":"47","author":"G. Z\u00e9mor","year":"2001","unstructured":"G. Z\u00e9mor: On expander codes, IEEE Transactions on Information Theory 47(2) (2001), 835\u2013837.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2463-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2463-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2463-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T20:54:10Z","timestamp":1559681650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2463-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["2463"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2463-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}