Breaking the k 2 barrier for explicit RIP matrices

DOI10.1145/1993636.1993721zbMath1288.68062OpenAlexW2003868973MaRDI QIDQ5419134

Kevin Ford, Denka Kutzarova, Jean Bourgain, Sergei V. Konyagin, Stephen Dilworth

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993721

zbMATH Keywords

compressed sensingrestricted isometry property

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (5)

Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery ⋮ A new upper bound for sets with no square differences ⋮ Derandomizing restricted isometries via the Legendre symbol ⋮ A class of deterministic sensing matrices and their application in harmonic detection ⋮ Explicit RIP matrices: an update

This page was built for publication: Breaking the k ² barrier for explicit RIP matrices