Deterministic construction of compressed sensing matrices with characters over finite fields
From MaRDI portal
Publication:4554544
DOI10.1142/S1793830918500611zbMATH Open1402.94035OpenAlexW2810730439MaRDI QIDQ4554544FDOQ4554544
Authors: Gang Wang, Min-Yao Niu, Fangwei Fu 
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
Recommendations
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic constructions of compressed sensing matrices based on codes
- New construction of deterministic compressed sensing matrices based on vector space over finite fields
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Other character sums and Gauss sums (11T24)
Cites Work
- Decoding by Linear Programming
- Stable signal recovery from incomplete and inaccurate measurements
- A simple proof of the restricted isometry property for random matrices
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Compressed sensing and best \(k\)-term approximation
- Title not available (Why is that?)
- Sparse Approximate Solutions to Linear Systems
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- Deterministic constructions of compressed sensing matrices
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Explicit constructions of RIP matrices and related problems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Title not available (Why is that?)
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
- Matrices With Small Coherence Using $p$-Ary Block Codes
Cited In (14)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Multivariable polynomials for the construction of binary sensing matrices
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
- A class of deterministic sensing matrices and their application in harmonic detection
- Sparsification of matrices and compressed sensing
- Welch bound-achieving compressed sensing matrices from optimal codebooks
- New construction of deterministic compressed sensing matrices based on vector space over finite fields
- Three deterministic constructions of compressed sensing matrices with low coherence
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
- Deterministic constructions of compressed sensing matrices based on codes
Uses Software
This page was built for publication: Deterministic construction of compressed sensing matrices with characters over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554544)
