An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices

We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted isometry property. We show that a matrix formed by uniformly subsampling rows of an $N \times N$ Walsh matrix contains a $K$-spars...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Błasiok, Jarosław, Lopatto, Patrick, Luh, Kyle, Marcinek, Jake, Rao, Shravas
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Computer Science - Information Theory Mathematics - Information Theory Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!