Construction of sparse binary sensing matrices using set systems
From MaRDI portal
Recommendations
- Deterministic construction of sparse binary matrices via incremental integer optimization
- Deterministic construction of compressed sensing matrices over finite sets
- Deterministic construction of compressed sensing matrices from codes
- Compressive sensing and algebraic coding: connections and challenges
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
Cites work
- A remark on compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing and best \(k\)-term approximation
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Constructing set systems with prescribed intersection sizes
- 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
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Explicit constructions of RIP matrices and related problems
- scientific article; zbMATH DE number 5764871 (Why is no real title available?)
- scientific article; zbMATH DE number 3944477 (Why is no real title available?)
- Stable recovery of sparse overcomplete representations in the presence of noise
- Steiner equiangular tight frames
- The restricted isometry property and its implications for compressed sensing
Cited in
(3)
This page was built for publication: Construction of sparse binary sensing matrices using set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801915)