One-bit sensing, discrepancy and Stolarsky's principle

A sign-linear one-bit map from the d-dimensional sphere S^d to the N-dimensional Hamming cube H^N = {-1,+1}ⁿ is given by × ↦ {sign(x · z_j): 1 ≤ j ≤ N}, where {z_j} C S^d. For 0 < δ < 1, we estimate N(d,δ), the smallest integer N so that there is a sign-linear map which has the δ-restricted isometric property, where we impose the normalized geodesic distance on S^d and the Hamming metric on H^N. Up to a polylogarithmic factor, N(d,δ) ≈ δ^-2+2/(d+1), which has a dimensional correction in the power of δ. This is a question that arises from the one-bit sensing literature, and the method of proof follows from geometric discrepancy theory. We also obtain an analogue of the Stolarsky invariance principle for this situation, which implies that minimizing the L²-average of the embedding error is equivalent to minimizing the discrete energy Σ_i,j (1/2 - d(z_i, z_j)², where d is the normalized geodesic distance.