Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
From MaRDI portal
Publication:2008183
DOI10.1016/j.amc.2018.09.042zbMath1428.94039OpenAlexW2897237705MaRDI QIDQ2008183
Gang Wang, Min-Yao Niu, Fang-Wei Fu
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.042
Linear codes (general theory) (94B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (3)
An effective algorithm for the spark of sparse binary measurement matrices ⋮ Welch bound-achieving compressed sensing matrices from optimal codebooks ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A simple proof of the restricted isometry property for random matrices
- Spherical codes and designs
- Deterministic constructions of compressed sensing matrices
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Compressed sensing and best 𝑘-term approximation
- Algebraic Function Fields and Codes
- Decoding by Linear Programming
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Complex Codebooks From Combinatorial Designs
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Matrices With Small Coherence Using $p$-Ary Block Codes
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Sparse Approximate Solutions to Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
