Error correction via linear programming
Top Cited Papers
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 72 (02725428) , 668-681
- https://doi.org/10.1109/sfcs.2005.5464411
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 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 = Af + e?Keywords
This publication has 25 references indexed in Scilit:
- Sparse representations in unions of basesIEEE Transactions on Information Theory, 2003
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- Filter bank frame expansions with erasuresIEEE Transactions on Information Theory, 2002
- Multiple description coding: compression meets the networkIEEE Signal Processing Magazine, 2001
- Quantized Frame Expansions with ErasuresApplied and Computational Harmonic Analysis, 2001
- On the distribution of the largest eigenvalue in principal components analysisThe Annals of Statistics, 2001
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithmsIEEE Transactions on Information Theory, 1998
- Gaussian Random FunctionsPublished by Springer Nature ,1995
- Ten Lectures on WaveletsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992