Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 252

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Compressive Sampling and Lossy Compression

Goyal, V.K., Fletcher, A.K., Rangan, S. · 2008 · IEEE Signal Processing Magazine

Abstract

Recent results in compressive sampling have shown that sparse signals can be recovered from a small number of random measurements. This property raises the question of whether random measurements can provide an efficient representation of sparse signals in an information-theoretic sense. Through both theoretical and experimental results, we show that encoding a sparse signal through simple scalar quantization of random measurements incurs a significant penalty relative to direct or adaptive encoding of the sparse signal. Information theory provides alternative quantization strategies, but they come at the cost of much greater estimation complexity.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/msp.2007.915001

Cites

21 of 21 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 21 references

Cited by

See all 252

Metadata

Authors
Goyal, V. K., Fletcher, A. K., & Rangan, S.
Venue
IEEE Signal Processing Magazine
Published
2008-03
Volume
25
Issue
2
Pages
48-56
ISSN
1053-5888 (ISSN-L)
OpenAlex
W2118016489
Cited by
252
References
21
FWCI
21.70
Type
journal article
Language
en
Open access
closed

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: Compressive Sampling and Lossy Compression. https://app.cochat.ai/papers/10.1109/msp.2007.915001
The paper
Goyal, V. K., Fletcher, A. K., & Rangan, S. (2008). Compressive Sampling and Lossy Compression. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2007.915001

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.