Highly robust error correction by convex programming

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

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Emmanuel J. Candès, Paige A. Randall
• Keywords: Arbitrary Gross Errors, CORR 2006, Education, Gross Errors, Linear Codes