Construction of Sparse Binary Sensing Matrices Using Set Systems

DOI10.1007/978-81-322-2485-3_21zbMath1381.94037OpenAlexW2403524361MaRDI QIDQ2801915

R. Ramu Naidu

Publication date: 22 April 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2485-3_21

zbMATH Keywords

compressed sensingrestricted isometry propertyset systemsdeterministic construction

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit constructions of RIP matrices and related problems
• Steiner equiangular tight frames
• The restricted isometry property and its implications for compressed sensing
• A remark on compressed sensing
• A simple proof of the restricted isometry property for random matrices
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Deterministic constructions of compressed sensing matrices
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Compressed sensing and best 𝑘-term approximation
• Stable recovery of sparse overcomplete representations in the presence of noise
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Constructing set systems with prescribed intersection sizes
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices