Decoding by linear programming

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to recover f exact...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 51; číslo 12; s. 4203 - 4215
Hlavní autoři:	Candes, E.J., Tao, T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.12.2005 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Applied sciences Basis pursuit Codes Coding Coding, codes Communications networks Decoding decoding of (random) linear codes Detection, estimation, filtering, equalization, prediction duality in optimization Equations Error correction Error correction codes Errors Exact sciences and technology Gaussian random matrices Information systems Information theory Information, signal and communications theory Linear code linear codes Linear programming Mathematical analysis Mathematics principal angles restricted orthonormality Signal and communications theory Signal, noise singular values of random matrices Sparse matrices sparse solutions to underdetermined systems Telecommunications and information theory Vectors Vectors (mathematics) Singularity linear codes Uncertainty principle Gaussian random matrices Linear programming Decoding Random coding Random codes Convex programming 1 minimization sparse solutions to underdetermined systems Optimization Linear code restricted orthonormality Linear system singular values of random matrices principal angles Signal processing Signal reconstruction duality in optimization Error correction Index Terms-Basis pursuit decoding of (random) linear codes
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!