Bilinear Compressive Security with Finitely Many Samples
Researchers show finite-sample key recovery against Bilinear Compressive Security depends on measurement-matrix sparsity.
Stories per day · 30 days
2 stories, newest first · one card per story
Stories tagged #compressed-sensing
The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
Researchers derive sufficient sample-size conditions for recovering sparse binary signals from sparse Gaussian measurements, quantifying an information-theoretic threshold of order slog(p/s)/log(ds/p).