Decoding by Linear Programming

DMCA

Decoding by Linear Programming (2004)

Cached

Download Links

by Emmanuel J. Candès , Terence Tao

Citations:

1365 - 16 self

Citations

13825	Computers and Intractability - A Guide to the Theory of NPCompleteness, Bell Telephone Laboratories, Incorporated - Garey, Johnson - 1979
7181	Convex Optimization - Boyd, Vandenberghe - 2004
2677	Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
2558	Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information - Candes, Romberg, et al.
1475	Near optimal signal recovery from random projections: Universal encoding strategies - Candes, Tao - 2006
959	Aspects of Multivariate Statistical Theory - Muirhead - 1982
901	Greed is good: Algorithmic results for sparse approximation - Tropp - 2004
612	Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization - Donoho, Elad - 2003
579	The Concentration of Measure Phenomenon - Ledoux - 2001
573	Uncertainty principles and ideal atomic decomposition - Donoho, X - 2001
550	For most large underdetermined systems of linear equations the minimal l1−norm solution is also the sparsest solution. Communications on pure and applied mathematics - Donoho
544	Sparse approximate solutions to linear systems - Natarajan - 1995
404	On the distribution of the largest eigenvalue in principle components analysis - Johnstone - 2001
332	Sparse representations in unions of bases - Gribonval, Nielsen - 2003
244	A generalized uncertainty principle and sparse representation in pairs of RN bases - Bruckstein, Elad - 2002
205	Local operator theory, random matrices and Banach spaces. In Handbook of the geometry of Banach spaces, edited by - Davidson, Szarek
180	Using linear programming to decode binary linear codes - Feldman, Wainwright, et al. - 2005
178	Quantitative robust uncertainty principles and optimally sparse decompositions - Candes, Romberg
149	A limit theorem for the norm of random matrices - Geman - 1980
115	Decoding error-correcting codes via linear programming - Feldman - 2003
86	Least Absolute Deviations: Theory, Applications, and Algorithms - Bloomfield, Steiger - 1984
67	LP decoding corrects a constant fraction of errors - Feldman, Malkin, et al. - 2007
62	The smallest eigenvalue of a large dimensional wishart matrix - Silverstein - 1985
61	Limit of the smallest eigenvalue of a large-dimensional sample covariance matrix - Bai, Yin - 1993
57	Distribution of eigenvalues in certain sets of random matrices - Marchenko, Pastur - 1967
57	Condition numbers of random matrices - SZAREK - 1991
27	LP decoding achieves capacity - Feldman, Stein - 2005
17	The limiting empirical measure of multiple discriminant ratios,” The Annals of Statistics 8 - Wachter - 1980
9	Compressed sensing.” Unpublished manuscript - Donoho - 2004
7	New Results about Random Covariance Matrices and Statistical Applications. Stanford Ph - Karoui - 2004
2	Large covariance matrices. Third 2004 Wald Lecture - Johnstone - 2004
1	decoding achieves capacity,” presented at the ACM-SIAM Symp. Discrete Algorithms - “LP - 2005
1	Authorized licensed use limited to - Anal - 2001