Michael T. Lacey

Learn More
We obtain mproved bounds for one bit sensing. For instance, let K s denote the set of s-sparse unit vectors in the sphere S n in dimension n + 1 with sparsity parameter 0 < s < n+1 and assume that 0 < δ < 1. We show that for m δ −2 s log n s , the one-bit map x → sgnx, g j m j=1 , where g j are iid gaussian vectors on R n+1 , with high probability has δ-RIP(More)
  • 1