Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes

[1]  You Gao,et al.  Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields , 2016 .

[2]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[3]  Gennian Ge,et al.  Deterministic Sensing Matrices Arising From Near Orthogonal Systems , 2014, IEEE Transactions on Information Theory.

[4]  Gennian Ge,et al.  Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves , 2012, IEEE Transactions on Information Theory.

[5]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[6]  Farrokh Marvasti,et al.  Matrices With Small Coherence Using $p$-Ary Block Codes , 2012, IEEE Transactions on Signal Processing.

[7]  Farrokh Marvasti,et al.  Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices , 2009, IEEE Transactions on Information Theory.

[8]  Stephen J. Dilworth,et al.  Explicit constructions of RIP matrices and related problems , 2010, ArXiv.

[9]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[10]  R. Calderbank,et al.  Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery , 2009 .

[11]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[12]  Deanna Needell,et al.  Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..

[13]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[14]  A. Robert Calderbank,et al.  A fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[15]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[16]  Cunsheng Ding,et al.  A Generic Construction of Complex Codebooks Meeting the Welch Bound , 2007, IEEE Transactions on Information Theory.

[17]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[18]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[19]  Cunsheng Ding,et al.  Complex Codebooks From Combinatorial Designs , 2006, IEEE Transactions on Information Theory.

[20]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[21]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[22]  Chaoping Xing,et al.  Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound , 2003, IEEE Transactions on Information Theory.

[23]  Dilip V. Sarwate.  Meeting the Welch Bound with Equality , 1998, SETA.

[24]  R. H. Hardin,et al.  Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 2002, Exp. Math..

[25]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[26]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[27]  J. Seidel,et al.  Spherical codes and designs , 1977 .

[28]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.