{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T10:16:07Z","timestamp":1789726567661,"version":"4.0.1"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/sfcs.2005.5464411","type":"proceedings-article","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T12:50:22Z","timestamp":1274878222000},"page":"668-681","source":"Crossref","is-referenced-by-count":135,"title":["Error correction via linear programming"],"prefix":"10.1109","author":[{"given":"Emmanuel","family":"Candes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Rudelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Terence","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Vershynin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"407","article-title":"Distribution of eigenvalues in certain sets of random matrices","volume":"72","author":"marchenko","year":"1967","journal-title":"Mat Sb (N S )"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8474-6"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.650985"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/acha.2000.0340"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/79.952806"},{"key":"ref37","article-title":"The concentration of measure phenomenon","author":"ledoux","year":"2001","journal-title":"Math Surveys Monogr"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003832"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1009210544"},{"key":"ref34","article-title":"Handbook of coding theory","volume":"i ii","author":"pless","year":"1998"},{"key":"ref10","article-title":"Near optimal signal recovery from random projections: universal encoding strategies?","author":"cand\u00e8s","year":"2004","journal-title":"Submitted to IEEE Transactions on Information Theory"},{"key":"ref40","article-title":"Lectures on discrete geometry","author":"matousek","year":"2002","journal-title":"Graduate Texts in Mathematics 212"},{"key":"ref11","article-title":"Decoding by linear programming","author":"cand\u00e8s","year":"2004","journal-title":"Available on the ArXiV preprint server math MG\/0502327"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970104"},{"key":"ref14","author":"donoho","year":"2004","journal-title":"For Most Large Underdetermined Systems of Linear Equations the Minimal 11-norm Solution is also the Sparsest Solution Manuscript"},{"key":"ref15","author":"donoho","year":"2004","journal-title":"For most large underdetermined systems of linear equations the minimal -norm near-solution approximates the sparsest near-solution"},{"key":"ref16","author":"donoho","year":"2004","journal-title":"Compressed sensing Manuscript"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via 11 minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Natl Acad Sci"},{"key":"ref18","author":"donoho","year":"0","journal-title":"Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref28","first-page":"200","article-title":"The widths of a Euclidean ball (Russian)","volume":"30","author":"yu garnaev","year":"1984","journal-title":"Dokl Akad Nauk SSSR 277(1984) 1048&#x2013;1052 English translation Soviet Math Dokl"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811926"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806117"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021349819855"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/79.952802"},{"key":"ref5","first-page":"33","article-title":"Atomic decomposition by basis pursuit","author":"chen","year":"0","journal-title":"SIAM J Sci Comput 20 (1998)"},{"key":"ref8","article-title":"Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information","author":"cand\u00e8s","year":"2004","journal-title":"To appear IEEE Transactions on Information Theory"},{"key":"ref7","article-title":"Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions","author":"cand\u00e8s","year":"2004","journal-title":"Foundations of Computational Mathematics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02762864"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02784520"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref20","author":"donoho","year":"0","journal-title":"Extensions of compresed sensing preprint"},{"key":"ref45","article-title":"Recovery of short, complex linear combinations via 11 minimization","author":"tropp","year":"0","journal-title":"To appear in IEEE Trans Inform Theory"},{"key":"ref22","article-title":"New Results about Random Covariance Matrices and Statistical Applications","author":"el karoui","year":"2004"},{"key":"ref47","first-page":"4","article-title":"Just relax: Convex programming methods for subset selection and sparse approximation","author":"tropp","year":"2004","journal-title":"ICES Report"},{"key":"ref21","author":"donoho","year":"0","journal-title":"Breakdown of Equivalence between the minimal l l-norm Solution and the Sparsest Solution preprint"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref24","article-title":"Decoding Error-Correcting Codes via Linear Programming","author":"feldman","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44489-3_17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801410"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(91)90002-F"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"key":"ref43","article-title":"Geometric approach to error correcting codes and reconstruction of signals","author":"rudelson","year":"0","journal-title":"Available on the ArXiV preprint server math FA\/0502299"},{"key":"ref25","article-title":"LP decoding achieves capacity","author":"feldman","year":"2005","journal-title":"2005 ACM-SIAM Symposium on Discrete Algorithms (SODA)"}],"event":{"name":"46th Annual IEEE Symposium on Foundations of Computer Science","location":"Pittsburgh, PA","start":{"date-parts":[[2005,10,25]]},"end":{"date-parts":[[2005,10,25]]}},"container-title":["46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10244\/32664\/05464411.pdf?arnumber=5464411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T04:40:06Z","timestamp":1497847206000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5464411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2005.5464411","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}