Welch bound-achieving compressed sensing matrices from optimal codebooks
From MaRDI portal
Recommendations
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic constructions of compressed sensing matrices based on codes
- Deterministic construction of compressed sensing matrices from codes
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Deterministic construction of compressed sensing matrices from constant dimension codes
Cites work
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Compressed sensing
- Decoding by Linear Programming
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- Deterministic constructions of compressed sensing matrices
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Explicit constructions of RIP matrices and related problems
- scientific article; zbMATH DE number 1740059 (Why is no real title available?)
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Matrices With Small Coherence Using $p$-Ary Block Codes
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Stable signal recovery from incomplete and inaccurate measurements
Cited in
(2)
This page was built for publication: Welch bound-achieving compressed sensing matrices from optimal codebooks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965909)