乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:01:00Z","timestamp":1740110460779,"version":"3.37.3"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771071","61972051"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1016\/j.amc.2019.124965","type":"journal-article","created":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T21:29:17Z","timestamp":1577136557000},"page":"124965","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["An effective algorithm for the spark of sparse binary measurement matrices"],"prefix":"10.1016","volume":"371","author":[{"given":"Fenghua","family":"Tong","sequence":"first","affiliation":[]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Haipeng","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.amc.2019.124965_bib0001","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Candes","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.amc.2019.124965_bib0002","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","article-title":"Near-optimal signal recovery from random projections: universal encoding strategies?","volume":"52","author":"Candes","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.amc.2019.124965_bib0003","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.amc.2019.124965_bib0004","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.aeue.2017.05.028","article-title":"An efficient privacy-preserving scheme for secure network coding based on compressed sensing","volume":"79","author":"Xie","year":"2017","journal-title":"AEU Int. J. Electron. Commun."},{"issue":"3","key":"10.1016\/j.amc.2019.124965_bib0005","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/TBCAS.2017.2665659","article-title":"Secure and energy-efficient data transmission system based on chaotic compressive sensing in body-to-body networks","volume":"11","author":"Peng","year":"2017","journal-title":"IEEE Trans. Biomed. Circu. Syst."},{"issue":"2","key":"10.1016\/j.amc.2019.124965_bib0006","doi-asserted-by":"crossref","first-page":"3212","DOI":"10.1109\/JIOT.2018.2881129","article-title":"Flexible and secure data transmission system based on semi-tensor compressive sensing in wireless body area networks","volume":"6","author":"Li","year":"2019","journal-title":"IEEE Int. Things J."},{"issue":"12","key":"10.1016\/j.amc.2019.124965_bib0007","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Candes","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.amc.2019.124965_bib0008","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.amc.2019.124965_bib0009","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","article-title":"Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit","volume":"58","author":"Donoho","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.amc.2019.124965_bib0010","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CosaMP: iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2009","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"2","key":"10.1016\/j.amc.2019.124965_bib0011","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","article-title":"Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit","volume":"4","author":"Needell","year":"2010","journal-title":"IEEE J. Selected Top. Signal Process."},{"issue":"3","key":"10.1016\/j.amc.2019.124965_bib0012","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","article-title":"A simple proof of the restricted isometry property for random matrices","volume":"28","author":"Baraniuk","year":"2008","journal-title":"Construct. Approx."},{"issue":"4","key":"10.1016\/j.amc.2019.124965_bib0013","doi-asserted-by":"crossref","first-page":"2360","DOI":"10.1109\/TIT.2011.2111670","article-title":"Deterministic construction of binary, bipolar, and ternary compressed sensing matrices","volume":"57","author":"Amini","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.amc.2019.124965_bib0014","doi-asserted-by":"crossref","first-page":"3093","DOI":"10.1109\/TIT.2011.2181819","article-title":"LDPC Codes for compressed sensing","volume":"58","author":"Dimakis","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.amc.2019.124965_bib0015","doi-asserted-by":"crossref","first-page":"1960","DOI":"10.1109\/LSP.2015.2447934","article-title":"Deterministic construction of compressed sensing matrices from protograph LDPC codes","volume":"22","author":"Zhang","year":"2015","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.amc.2019.124965_bib0016","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.amc.2018.09.042","article-title":"Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes","volume":"343","author":"Wang","year":"2019","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.amc.2019.124965_bib0017","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1109\/TIT.2014.2303973","article-title":"Deterministic sensing matrices arising from near orthogonal systems","volume":"60","author":"Li","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"14","key":"10.1016\/j.amc.2019.124965_bib0018","doi-asserted-by":"crossref","first-page":"3566","DOI":"10.1109\/TSP.2016.2550020","article-title":"Deterministic compressed sensing matrices: construction via euler squares and applications","volume":"64","author":"Naidu","year":"2016","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"10.1016\/j.amc.2019.124965_bib0019","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.jco.2007.04.002","article-title":"Deterministic constructions of compressed sensing matrices","volume":"23","author":"DeVore","year":"2007","journal-title":"J. Complex."},{"issue":"8","key":"10.1016\/j.amc.2019.124965_bib0020","doi-asserted-by":"crossref","first-page":"5035","DOI":"10.1109\/TIT.2012.2196256","article-title":"Deterministic construction of compressed sensing matrices via algebraic curves","volume":"58","author":"Li","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.amc.2019.124965_bib0021","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1109\/TSP.2014.2386300","article-title":"Deterministic constructions of binary measurement matrices from finite geometry","volume":"63","author":"Xia","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"10.1016\/j.amc.2019.124965_bib0022","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1109\/TSP.2014.2318139","article-title":"Deterministic construction of sparse sensing matrices via finite geometry","volume":"62","author":"Li","year":"2014","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"10.1016\/j.amc.2019.124965_bib0023","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization","volume":"100","author":"Donoho","year":"2003","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6","key":"10.1016\/j.amc.2019.124965_bib0024","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1007\/s00041-012-9235-4","article-title":"Full spark frames","volume":"18","author":"Alexeev","year":"2012","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"10.1016\/j.amc.2019.124965_bib0025","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/TIT.2013.2290112","article-title":"The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing","volume":"60","author":"Tillmann","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.amc.2019.124965_bib0026","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/LSP.2017.2749043","article-title":"On the spark of binary LDPC measurement matrices from complete protographs","volume":"24","author":"Liu","year":"2017","journal-title":"IEEE Signal Process. Lett."},{"issue":"12","key":"10.1016\/j.amc.2019.124965_bib0027","doi-asserted-by":"crossref","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","article-title":"Sparse representations in unions of bases","volume":"49","author":"Gribonval","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.amc.2019.124965_bib0028","doi-asserted-by":"crossref","first-page":"3707","DOI":"10.1109\/TIT.2006.878179","article-title":"Shortened array codes of large girth","volume":"52","author":"Milenkovic","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.amc.2019.124965_bib0029","series-title":"Proceedings of the IEEE International Symposium on Information Theory","first-page":"479","article-title":"Constructions of quasi-cyclic measurement matrices based on array codes","author":"Liu","year":"2013"},{"issue":"9","key":"10.1016\/j.amc.2019.124965_bib0030","doi-asserted-by":"crossref","first-page":"5204","DOI":"10.1109\/TIT.2014.2333519","article-title":"On the minimum\/stopping distance of array low-density parity-check codes","volume":"60","author":"Rosnes","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"year":"2006","series-title":"Geometry of classical groups over finite fields","author":"Wan","key":"10.1016\/j.amc.2019.124965_bib0031"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319309579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319309579?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T00:54:12Z","timestamp":1613264052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300319309579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":31,"alternative-id":["S0096300319309579"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2019.124965","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An effective algorithm for the spark of sparse binary measurement matrices","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2019.124965","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"124965"}}