Deterministic Construction of Compressed Sensing Matrices from Codes
From MaRDI portal
Publication:4977889
DOI10.1142/S0129054117500071zbMath1379.94020OpenAlexW2605179551MaRDI QIDQ4977889
Publication date: 17 August 2017
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054117500071
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items
Deterministic constructions of compressed sensing matrices based on codes ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
Cites Work
- Explicit constructions of RIP matrices and related problems
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Deterministic constructions of compressed sensing matrices
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Sparse Approximate Solutions to Linear Systems
- LDPC Codes for Compressed Sensing
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Compressed sensing
