暂无分享,去创建一个
[1] Ronald A. DeVore,et al. Deterministic constructions of compressed sensing matrices , 2007, J. Complex..
[3] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[4] 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.
[5] Amnon Ta-Shma,et al. Constructing Small-Bias Sets from Algebraic-Geometric Codes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[6] A. Robert Calderbank,et al. Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.
[7] I. M. Gelʹfand,et al. Discriminants, Resultants, and Multidimensional Determinants , 1994 .
[8] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[9] TORIC SURFACES AND CODES , TECHNIQUES AND EXAMPLES , 2004 .
[10] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[11] Gennian Ge,et al. Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves , 2012, IEEE Transactions on Information Theory.
[12] P. Deligne. La conjecture de Weil. I , 1974 .
[13] Juliane Hahn,et al. Algebraic Geometric Codes , 2016 .
[14] A. Robert Calderbank,et al. Why Gabor frames? Two fundamental measures of coherence and their role in model selection , 2010, Journal of Communications and Networks.
[15] Na Zhao,et al. Deterministic Construction of Real-Valued Ternary Sensing Matrices Using Optical Orthogonal Codes , 2013, IEEE Signal Processing Letters.
[16] S. Hansen,et al. Error-Correcting Codes from Higher-Dimensional Varieties , 2001 .
[17] Yonina C. Eldar,et al. Compressed Sensing with Coherent and Redundant Dictionaries , 2010, ArXiv.
[18] David Schwein,et al. Étale Cohomology , 2018, Translations of Mathematical Monographs.
[19] T. Willmore. Algebraic Geometry , 1973, Nature.
[20] G. Lusztig,et al. Representations of reductive groups over finite fields , 1976 .
[21] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[22] E. Candès. Mathematics of Sparsity (and a Few Other Things) , 2014 .
[23] Dustin G. Mixon,et al. Two are better than one: Fundamental parameters of frame coherence , 2011, 1103.0435.
[24] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[25] Yao Xie,et al. On Block Coherence of Frames , 2013, 1307.7544.
[26] G. Ballew,et al. The Arithmetic of Elliptic Curves , 2020, Elliptic Curves.
[27] J. Brasselet. Introduction to toric varieties , 2004 .
[28] Farrokh Marvasti,et al. Matrices With Small Coherence Using $p$-Ary Block Codes , 2012, IEEE Transactions on Signal Processing.
[29] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[30] Mohamad Mahdi Mohades,et al. A Reed-Solomon Code Based Measurement Matrix with Small Coherence , 2014, IEEE Signal Processing Letters.
[31] A. Robert Calderbank,et al. Efficient and Robust Compressed Sensing Using Optimized Expander Graphs , 2009, IEEE Transactions on Information Theory.