CaltechAUTHORS
A Caltech Library Service

# Error correction via linear programming

Candes, Emmanuel and Rudelson, Mark and Tao, Terence and Vershynin, Roman (2005) Error correction via linear programming. In: 46th Annual IEEE Symposium on Foundations of Computer Science. Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press , Los Alamitos, CA, pp. 668-681. ISBN 0-7695-2468-0 . http://resolver.caltech.edu/CaltechAUTHORS:20110609-075242535

 Preview
PDF - Published Version
See Usage Policy.

239Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20110609-075242535

## Abstract

Suppose we wish to transmit a vector f Є 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. 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? This paper proves that under suitable conditions on the coding matrix A, the input f is the unique solution to the ℓ_1 -minimization problem (‖x‖ℓ_1: = ∑_i |xi|) min ‖y − Ag‖ℓ_1 g^∈Rn provided that the fraction of corrupted entries is not too large, i.e. does not exceed some strictly positive constant ρ ∗ (numerical values for ρ ^∗ are 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 ℓ_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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/SFCS.2005.5464411DOIUNSPECIFIED
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5464411PublisherUNSPECIFIED