{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:20:11Z","timestamp":1772302811075,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T00:00:00Z","timestamp":1536796800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61171082"],"award-info":[{"award-number":["No.61171082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61301137"],"award-info":[{"award-number":["61301137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Ph.D. Candidate Research Innovation Fund of Nankai University","award":["No.91822144"],"award-info":[{"award-number":["No.91822144"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s12095-018-0328-z","type":"journal-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T05:27:26Z","timestamp":1536816446000},"page":"759-775","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Deterministic constructions of compressed sensing matrices based on codes"],"prefix":"10.1007","volume":"11","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Yao","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,13]]},"reference":[{"issue":"4","key":"328_CR1","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"328_CR2","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","volume":"58","author":"D Donoho","year":"2006","unstructured":"Donoho, D., Tsaig, Y., Drori, I., Starck, J.: Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. IEEE Trans. Inform. Theory 58(2), 1094\u20131121 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"328_CR3","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurement. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"2","key":"328_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan, B.: Sparse approximate solutions to linear systems. SIAM J. comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. comput."},{"issue":"12","key":"328_CR5","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp, J., Gilbert, A.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"328_CR6","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"328_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.: Cosamp: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"328_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10208-008-9031-3","volume":"9","author":"D Needell","year":"2009","unstructured":"Needell, D., Vershynin, R.: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math. 9(3), 317\u2013334 (2009)","journal-title":"Found. Comput. Math."},{"issue":"12","key":"328_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"328_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Compressed sensing and best k-term approximation. J. Amer. Math. Soc. 22(1), 211\u2013231 (2009)","journal-title":"J. Amer. Math. Soc."},{"issue":"3","key":"328_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","volume":"28","author":"R Baraniuk","year":"2008","unstructured":"Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28(3), 253\u2013263 (2008)","journal-title":"Constr. Approx."},{"issue":"6","key":"328_CR12","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/JPROC.2010.2045092","volume":"98","author":"A Gilbert","year":"2010","unstructured":"Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. Proc. IEEE 98 (6), 937\u2013947 (2010)","journal-title":"Proc. IEEE"},{"issue":"1","key":"328_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1215\/00127094-1384809","volume":"159","author":"J Bourgain","year":"2011","unstructured":"Bourgain, J., Dilworth, S., Ford, K., Konyagin, S., Kutzarova, D.: Explicit constructions of RIP matrices and related problems. Duke Math. J. 159(1), 145\u2013185 (2011)","journal-title":"Duke Math. J."},{"issue":"3","key":"328_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L Welch","year":"1974","unstructured":"Welch, L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20(3), 397\u2013399 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4-6","key":"328_CR15","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.jco.2007.04.002","volume":"23","author":"R DeVore","year":"2007","unstructured":"DeVore, R.: Deterministic constructions of compressed sensing matrices. J. Complex. 23(4-6), 918\u2013925 (2007)","journal-title":"J. Complex."},{"issue":"8","key":"328_CR16","doi-asserted-by":"publisher","first-page":"5035","DOI":"10.1109\/TIT.2012.2196256","volume":"58","author":"S Li","year":"2012","unstructured":"Li, S., Gao, F., Ge, G., Zhang, S.: Deterministic construction of compressed sensing matrices via algebraic curves. IEEE Trans. Inf. Theory 58(8), 5035\u20135041 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"328_CR17","doi-asserted-by":"publisher","first-page":"1650025 (16 pag","DOI":"10.1142\/S0219498816500250","volume":"15","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Zhang, X.: Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields. J. Algebra Appl. 15(2), 1650025 (16 pages) (2016)","journal-title":"J. Algebra Appl."},{"issue":"40","key":"328_CR18","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1109\/TIT.2014.2303973","volume":"6","author":"S Li","year":"2014","unstructured":"Li, S., Ge, G.: Deterministic sensing matrices arising from near orthogonal systems. IEEE Trans. Inf. Theory 6(40), 2291\u20132302 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"328_CR19","doi-asserted-by":"publisher","first-page":"2360","DOI":"10.1109\/TIT.2011.2111670","volume":"57","author":"A Amini","year":"2011","unstructured":"Amini, A., Marvasti, F.: Deterministic construction of binary, bipolar and ternary compressed sensing matrices. IEEE Trans. Inf. Theory 57(4), 2360\u20132370 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"328_CR20","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TSP.2011.2169249","volume":"60","author":"A Amini","year":"2012","unstructured":"Amini, A., Montazerhodjat, V., Marvasti, F.: Matrices with small coherence using p-ary block codes. IEEE Trans. Signal Process. 60(1), 172\u2013181 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"328_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0129054117500071","volume":"28","author":"X Wang","year":"2017","unstructured":"Wang, X., Fu, F.: Deterministic construction of compressed sensing matrices from codes. Int. J. Found. Comput. Sci. 28(2), 99\u2013109 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"328_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.acha.2008.08.002","volume":"26","author":"L Applebaum","year":"2009","unstructured":"Applebaum, L., Howard, S., Searle, S., Calderbank, R.: Chirp sensing codes: deterministic compressed sensing measurements for fast recovery. Appl. Comput. Harmon. Anal. 26(2), 283\u2013290 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"328_CR23","first-page":"11","volume":"1-3","author":"S Howard","year":"2008","unstructured":"Howard, S., Calderbank, A., Searle, J.: A fast reconstruction algorithm for deterministic compressive sensing using second order Reed- Muller codes. Proc. 42nd Annu. Conf. Inf. Sci. Syst. 1-3, 11\u201315 (2008)","journal-title":"Proc. 42nd Annu. Conf. Inf. Sci. Syst."},{"issue":"2","key":"328_CR24","first-page":"358","volume":"4","author":"R Calderbank","year":"2010","unstructured":"Calderbank, R., Howard, S., Jafarpour, S.: Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property. IEEE Trans. Inf. Theory 4(2), 358\u2013374 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"328_CR25","unstructured":"Indyk, P.: Explicit constructions for compressed sensing matrices. Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms 42(4), 30\u201333 (2008)"},{"key":"328_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes, Ser. Grad. Texts Math., vol. 254","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes, Ser. Grad. Texts Math., 2nd edn., vol. 254. Springer, Berlin (2009)","edition":"2"},{"issue":"7","key":"328_CR27","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1109\/TIT.2003.813559","volume":"49","author":"C Xing","year":"2003","unstructured":"Xing, C.: Nonlinear codes from algebraic curves improving the tsfasman-vl\u0103dut-zink bound. IEEE Trans. Inf. Theory 49(7), 1653\u20134046 (2003)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0328-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0328-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0328-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T06:45:23Z","timestamp":1662014723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0328-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,13]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0328-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,13]]},"assertion":[{"value":"3 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}