The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
One‐Bit Compressed Sensing by Linear Programming
Open accessAbstract
We give the first computationally tractable and almost optimal solution to the problem of one‐bit compressed sensing, showing how to accurately recover an s‐sparse vector \input amssym $x \in {\Bbb R}^n$ from the signs of $O(s \log^2(n/s))$ random linear measurements of x. The recovery is achieved by a simple linear program. This result extends to approximately sparse vectors x. Our result is universal in the sense that with high probability, one measurement scheme will successfully recover all sparse vectors simultaneously. The argument is based on solving an equivalent geometric problem on random hyperplane tessellations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Self-citationThe Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
The Volume of Convex Bodies and Banach Space Geometry
Pisier, G. (1989) · Cambridge University Press eBooks · doi:10.1017/cbo9780511662454 · Cited by 967
Alon, N., & Spencer, J. H. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 949
Compressed Sensing With Quantized Measurements
Zymnis, A., Boyd, S., & Candes, E. (2010) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2035667 · Cited by 316
Error correction via linear programming
Candes, E., Rudelson, M., Tao, T., & Vershynin, R. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.5464411 · Cited by 251
Self-citation
Cited by
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Jacques, L., Laska, J. N., Boufounos, P. T., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2234823 · Cited by 653
Davenport, M. A., Plan, Y., van den Berg, E., & Wootters, M. (2014) · Information and Inference · doi:10.1093/imaiai/iau006 · Cited by 277
Self-citationQuantized Massive MU-MIMO-OFDM Uplink
Studer, C., & Durisi, G. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2558151 · Cited by 259
Metadata
- Authors
- Plan, Y., & Vershynin, R.
- Venue
- Communications on Pure and Applied Mathematics
- Publisher
- Wiley
- Published
- 2013-02-12
- Volume
- 66
- Issue
- 8
- Pages
- 1275-1297
- ISSN
- 0010-3640 (ISSN-L)
- 1097-0312
- OpenAlex
- W2145218531
- Cited by
- 383
- References
- 13
- FWCI
- 43.65
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: One‐Bit Compressed Sensing by Linear Programming. https://app.cochat.ai/papers/10.1002/cpa.21442
- The paper
- Plan, Y., & Vershynin, R. (2013). One‐Bit Compressed Sensing by Linear Programming. Communications on Pure and Applied Mathematics. https://doi.org/10.1002/cpa.21442
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.