Decoding by Linear Programming

Emmanuel J. Candès, Terence Tao

Type: Preprint

Publication Date: 2005-01-01

Citations: 43

DOI: https://doi.org/10.48550/arxiv.math/0502327

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Decoding by Linear Programming	2005	Emmanuel J. Candès Terence Tao
+ PDF	Error correction via linear programming	2005	Emmanuel J. Candès Mark Rudelson Terence Tao Roman Vershynin
+	Highly robust error correction by convex programming	2006	Emmanuel J. Candès Paige Randall
+	Correcting Errors in Linear Measurements and Compressed Sensing of Multiple Sources	2013	Alexander Petukhov Inna Kozlov
+	Correcting Errors in Linear Measurements and Compressed Sensing of Multiple Sources	2013	A. K. Petukhov Inna Kozlov
+	Blind Deconvolution using Convex Programming	2012	Ali Ahmed Benjamin Recht Justin Romberg
+ PDF Chat	Sparse Signal Recovery from Quadratic Measurements via Convex Programming	2013	Xiaodong Li Vladislav Voroninski
+	Blind Deconvolution using Convex Programming	2012	Ali Ahmed Benjamin Recht Justin Romberg
+	Dense Error Correction via L1-Minimization	2008	John Wright Yi Ma
+	The Limits of Error Correction with lp Decoding	2010	Meng Wang Weiyu Xu Ao Tang
+	Sparse Signal Recovery from Quadratic Measurements via Convex Programming	2012	Xiaodong Li Vladislav Voroninski
+ PDF Chat	Blind Deconvolution Using Convex Programming	2014	Ali Ahmed Benjamin Recht Justin Romberg
+ PDF Chat	The limits of error correction with l<inf>p</inf> decoding	2010	Meng Wang Weiyu Xu Ao Tang
+	Dense Error Correction Via $\ell^1$-Minimization	2010	John Wright Yi Ma
+	Introduction to Mathematical Programming-Based Error-Correction Decoding	2015	Michael Helmling
+ PDF	Dense error correction via l1-minimization	2009	John Wright Yi Ma
+	Towards a better compressed sensing	2013	Mihailo Stojnic
+	Convex Coding	2012	David M. Bradley J. Andrew Bagnell
+	Convex Coding	2012	David M. Bradley J. Andrew Bagnell
+	Optimal linear estimation under unknown nonlinear transform	2015	Xinyang Yi Zhaoran Wang Constantine Caramanis Han Liu

Works That Cite This (22)

Action	Title	Year	Authors
+	Reconstruction and subgaussian operators	2005	Shahar Mendelson Alain Pajor Nicole Tomczak-Jaegermann
+	On sparse interpolation and the design of deterministic interpolation points	2013	Zhiqiang Xu Tao Zhou
+	Direct l_(2,p)-Norm Learning for Feature Selection	2015	Hanyang Peng Yong Fan
+	Model Identification of a Network as Compressing Sensing	2011	Donatello Materassi Giacomo Innocenti L. Giarré Murti V. Salapaka
+	A null space analysis of the L1 synthesis method in dictionary-based compressed sensing	2013	Xuemei Chen Haichao Wang Rongrong Wang
+ PDF Chat	Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements	2006	Mark Rudelson Roman Vershynin
+	The Kadison–Singer Problem in mathematics and engineering	2006	Peter G. Casazza Janet C. Tremain
+	Link Prediction in Graphs with Autoregressive Features	2012	Émile Richard Stéphane Gaïffas Nicolas Vayatis
+	Keep the phase! Signal recovery in phase-only compressive sensing.	2020	Laurent Jacques Thomas Feuillen
+	Link Prediction in Graphs with Autoregressive Features	2012	Émile Richard Stéphane Gaïffas Nicolas Vayatis

Works Cited by This (16)

Action	Title	Year	Authors
+ PDF	On the distribution of the largest eigenvalue in principal components analysis	2001	Iain M. Johnstone
+ PDF	The Concentration of Measure Phenomenon	2005	Michel Ledoux
+	Local Operator Theory, Random Matrices and Banach Spaces	2001	Kenneth R. Davidson Stanisław J. Szarek
+ PDF	Limit of the Smallest Eigenvalue of a Large Dimensional Sample Covariance Matrix	1993	Zhidong Bai Yanqing Yin
+ PDF	The Limiting Empirical Measure of Multiple Discriminant Ratios	1980	Kenneth W. Wachter
+	Condition numbers of random matrices	1991	Stanisław J. Szarek
+	Sparse Approximate Solutions to Linear Systems	1995	B. K. Natarajan
+	For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution	2006	David L. Donoho
+ PDF	A Limit Theorem for the Norm of Random Matrices	1980	Stuart Geman
+ PDF	The Smallest Eigenvalue of a Large Dimensional Wishart Matrix	1985	Jack W. Silverstein