Decoding by Linear Programming

Candes, E. J., & Tao, T. (2005). Decoding by Linear Programming. IEEE Transactions on Information Theory, 4203-4215.

Type

Journal article

Intellectual base

Primary research

Year

2005

Pages

4203-4215

DOI

10.1109/tit.2005.858979

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://doi.org/10.1109/TIT.2005.858979

Cited by

1 citation across 1 artifact.

Domain-specific

• Restricted isometry property
  • Candès and Tao developed related uniform-uncertainty conditions in the recovery-by-linear-programming program, showing why a restricted geometric certificate can stand in for an impossible global isometry when the ambient vector is sparse.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:6a3eb7a5ecbf · see in the full table