Deterministic construction of compressed sensing matrices with characters over finite fields
From MaRDI portal
Publication:4554544
DOI10.1142/S1793830918500611zbMath1402.94035OpenAlexW2810730439MaRDI QIDQ4554544
Gang Wang, Fang-Wei Fu, Min-Yao Niu
Publication date: 14 November 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500611
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Other character sums and Gauss sums (11T24)
Related Items
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
- 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
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Matrices With Small Coherence Using $p$-Ary Block Codes
- 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
