Deterministic construction of compressed sensing matrices from codes
From MaRDI portal
Recommendations
- Deterministic constructions of compressed sensing matrices based on codes
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
Cites work
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Decoding by Linear Programming
- Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Deterministic constructions of compressed sensing matrices
- Explicit constructions of RIP matrices and related problems
- LDPC Codes for Compressed Sensing
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(23)- Efficient deterministic compressed sensing for images with chirps and Reed-Muller codes
- Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Construction of sparse binary sensing matrices using set systems
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
- Multivariable polynomials for the construction of binary sensing matrices
- Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
- Efficiently decodable compressed sensing by list-recoverable codes and recursion
- Deterministic convolutional compressed sensing matrices
- Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
- Deterministic construction of sparse binary matrices via incremental integer optimization
- An asymptotic existence result on compressed sensing matrices
- Welch bound-achieving compressed sensing matrices from optimal codebooks
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Deterministic construction of compressed sensing matrices based on semilattices
- Deterministic constructions of compressed sensing matrices
- Reed-Muller sensing matrices and the LASSO (invited paper)
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
- Strengthening hash families and compressive sensing
- Partial Fourier codebooks associated with multiplied Golay complementary sequences for compressed sensing
- Deterministic constructions of compressed sensing matrices based on codes
This page was built for publication: Deterministic construction of compressed sensing matrices from codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977889)
