Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2006
Springer

favoriteEmaildiscussreport

92views Education» more CORR 2006»

Highly robust error correction by convex programming

13 years 4 months ago

Highly robust error correction by convex programming

Download www-stat.stanford.edu

This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x Rn (a block of n pieces of information) to a remote receiver. We ask whether it is possible to transmit this information reliably when a fraction of the transmitted codeword is corrupted by arbitrary gross errors, and when in addition, all the entries of the codeword are contaminated by smaller errors (e.g. quantization errors). We show that if one encodes the information as Ax where A Rm

Emmanuel J. Candès, Paige A. Randall

Real-time Traffic

Arbitrary Gross Errors | CORR 2006 | Education | Gross Errors | Linear Codes |

claim paper

Related Content

» Dense Error Correction for LowRank Matrices via Principal Component Pursuit

» Exterminator Automatically correcting memory errors with high probability

» Noisy matrix decomposition via convex relaxation Optimal rates in high dimensions

» Design of robust superdirective beamformers as a convex optimization problem

» Robust Spelling Correction

» Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions

» A robust implementation of a sequential quadratic programming algorithm with successive er...

» HiPER A Compact Narrow Channel Router with HopbyHop Error Correction

» Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3space

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Emmanuel J. Candès, Paige A. Randall

Comments (0)