Construction of Sparse Binary Sensing Matrices Using Set Systems (Q2801915): Difference between revisions

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