Multivariable polynomials for the construction of binary sensing matrices
From MaRDI portal
Recommendations
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic construction of compressed sensing matrices from codes
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Explicit constructions of RIP matrices and related problems
- Deterministic construction of compressed sensing matrices with characters over finite fields
Cites work
- A simple proof of the restricted isometry property for random matrices
- Atomic decomposition by basis pursuit
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Decoding by Linear Programming
- Deterministic constructions of compressed sensing matrices
- Explicit constructions of RIP matrices and related problems
- On the size of incoherent systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property and its implications for compressed sensing
Cited in
(2)
This page was built for publication: Multivariable polynomials for the construction of binary sensing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787249)