Information Theoretic Bounds for Compressed Sensing

DOI10.1109/TIT.2010.2059891zbMath1366.94179arXiv0804.3439MaRDI QIDQ5281264

Shuchin Aeron, Manqi Zhao, Venkatesh Saligrama

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.3439

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15) Rate-distortion theory in information and communication theory (94A34)

Related Items (10)

Iterative algorithm for discrete structure recovery ⋮ Sparse microwave imaging: principles and applications ⋮ Adaptive multi-penalty regularization based on a generalized Lasso path ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Which bridge estimator is the best for variable selection? ⋮ Fano's inequality for random variables ⋮ A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ⋮ Computational approaches to non-convex, sparsity-inducing multi-penalty regularization ⋮ Rigorous restricted isometry property of low-dimensional subspaces ⋮ The all-or-nothing phenomenon in sparse linear regression

This page was built for publication: Information Theoretic Bounds for Compressed Sensing