Exécution de notre outil de synthèse sur un nouvel article

Vérifiez l’article ci-dessous, puis lancez sa synthèse.


Breaking the k 2 barrier for explicit RIP matrices

Jean Bourgain (Institute for Advanced Study), S. J. Dilworth (University of South Carolina), Kevin Ford (University of Illinois Urbana-Champaign), Sergei Vladimirovich Konyagin (Steklov Mathematical Institute), Denka Kutzarova (Bulgarian Academy of Sciences)

ACM Symposium on Theory of Computing (STOC)
DOI: 10.1145/1993636.1993721 (Computer Science)
Licence : non indiquée (tous droits réservés)

Résumé : We give a new explicit construction of n x N matrices satisfying the Restricted Isometry Property (RIP). Namely, for some e>0, large k and k2-e ≤ N ≤ k2+e, we construct RIP matrices of order k with n=O(k2-e). This overcomes the natural barrier n >> k2 for proofs based on small coherence, which are used in all previous explicit constructions of RIP matrices. Key ingredients in our proof are new estimates for sumsets in product sets and for exponential sums with the products of sets possessing special additive structure.

Publié le 06 Jui. 2011