2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2005)

Pittsburgh, Pennsylvania, USA

Oct. 23, 2005 to Oct. 25, 2005

ISBN: 0-7695-2468-0

pp: 295-308

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.32

Terence Tao , UCLA

Emmanuel Candes , Caltech

Roman Vershynin , University of California, Davis

Mark Rudelson , University of Missouri

ABSTRACT

Suppose we wish to transmit a vector f \varepsilon R^n reliably. A frequently discussed approach consists in encoding f with an m by n coding matrix A. Assume now that a fraction of the entries of Af are corrupted in a completely arbitrary fashion by an error e. We do not know which entries are affected nor do we know how they are affected. Is it possible to recover f exactly from the corrupted m-dimensional vector y^1 = {\rm A}f + e? This paper proves that under suitable conditions on the coding matrix A, the input f is the unique solution to the (||x||\ell 1: = \Sigma i|xi|) \min ||y - {\rm A}f||\ell 1f\varepsilon R^n provided that the fraction of corrupted entries is not too large, i.e. does not exceed some strictly positive constant p^ * ( numerical values for p^ * are actually given). In other words, f can be recovered exactly by solving a simple convex optimization problem; in fact, a linear program. We report on numerical experiments suggesting that \ell 1 minimization is amazingly effective; f is recovered exactly even in situations where a very significant fraction of the output is corrupted. In the case when the measurement matrix A is Gaussian, the problem is equivalent to that of counting lowdimensional facets of a convex polytope, and in particular of a random section of the unit cube. In this case we can strengthen the results somewhat by using a geometric functional analysis approach.

INDEX TERMS

null

CITATION

Terence Tao,
Emmanuel Candes,
Roman Vershynin,
Mark Rudelson,
"Error Correction via Linear Programming",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 295-308, 2005, doi:10.1109/SFCS.2005.32SEARCH