z-logo
Premium
Error correction and convex programming
Author(s) -
Candès Emmanuel,
Randall Paige
Publication year - 2007
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.200700055
Subject(s) - regular polygon , computer science , error detection and correction , message passing , convex optimization , algorithm , mathematics , programming language , geometry
This article discusses a recently proposed error correction method involving convex optimization [1]. From an encoded and corrupted real‐valued message, a receiver would like to determine the original message. A few entries of the encoded message are corrupted arbitrarily (which we call gross errors) and all the entries of the encoded message are corrupted slightly. We show that it is possible to recover the message with nearly the same accuracy as in the setting where no gross errors occur. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here