Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
From MaRDI portal
Publication:5281551
DOI10.1109/TIT.2010.2040892zbMath1366.94233OpenAlexW2155942525MaRDI QIDQ5281551
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2040892
Linear codes and caps in Galois spaces (51E22) Combinatorial codes (94B25) Sampling theory in information and communication theory (94A20) Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)
Related Items (9)
SLOPE is adaptive to unknown sparsity and asymptotically minimax ⋮ From Acute Sets to Centrally Symmetric 2-Neighborly Polytopes ⋮ Counting the faces of randomly-projected hypercubes and orthants, with applications ⋮ The restricted isometry property of block diagonal matrices for group-sparse signal recovery ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Unnamed Item ⋮ Face numbers: the upper bound side of the story ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks ⋮ PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ1 LINEAR PROGRAMMING
This page was built for publication: Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
