Deterministic construction of compressed sensing matrices over finite sets
From MaRDI portal
Publication:5267510
zbMATH Open1455.94062MaRDI QIDQ5267510FDOQ5267510
Authors: Yingmo Jie, Xuemei Liu 
Publication date: 13 June 2017
Recommendations
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Deterministic construction of compressed sensing matrices from codes
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Deterministic constructions of compressed sensing matrices based on codes
- Deterministic constructions of compressed sensing matrices
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Boolean and Hadamard matrices (15B34)
Cited In (11)
- Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
- On the design of deterministic matrices for fast recovery of Fourier compressible functions
- Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Deterministic constructions of compressed sensing matrices
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
- Strengthening hash families and compressive sensing
- Deterministic constructions of compressed sensing matrices based on codes
This page was built for publication: Deterministic construction of compressed sensing matrices over finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267510)
