{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T15:47:15Z","timestamp":1776181635005,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61661146003"],"award-info":[{"award-number":["61661146003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Joint fund of the Ministry of Education of China","award":["6141A020223"],"award-info":[{"award-number":["6141A020223"]}]},{"name":"Application Fundamental Research Plan Project of Sichuan Province","award":["2018JY0046"],"award-info":[{"award-number":["2018JY0046"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2896006","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:29:32Z","timestamp":1549308572000},"page":"16704-16710","source":"Crossref","is-referenced-by-count":12,"title":["Deterministic Compressed Sensing Matrices From Sequences With Optimal Correlation"],"prefix":"10.1109","volume":"7","author":[{"given":"Zhi","family":"Gu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0228-7119","authenticated-orcid":false,"given":"Zhengchun","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Avik Ranjan","family":"Adhikary","sequence":"additional","affiliation":[]},{"given":"Xiaolun","family":"Cai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.135649"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889704"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.481790"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2796597"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2169249"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887502"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.028"},{"key":"ref12","first-page":"1433","article-title":"Compressive sampling","author":"cand\u00e8s","year":"2006","journal-title":"Proc Int Congr Math"},{"key":"ref13","first-page":"1402","article-title":"A method of image reconstruction based on sub-Gaussian random projection","volume":"45","author":"hong","year":"2008","journal-title":"J Comput Res Develop"},{"key":"ref14","first-page":"25","article-title":"Method of image reconstruction based on very sparse random projection","volume":"43","author":"fang","year":"2007","journal-title":"Comput Eng Appl"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WICOM.2010.5601036"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766223"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947166"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111670"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1215\/00127094-1384809"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2824329"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074472"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055219"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.916124"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-007-9005-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref9","article-title":"Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit","author":"wen","year":"0","journal-title":"Appl Comput Harmon Anal"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IAdCC.2013.6514392"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2303973"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196256"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2015.7148915"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2386300"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1049\/iet-spr.2017.0537"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2550020"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08634009.pdf?arnumber=8634009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T07:47:35Z","timestamp":1643269655000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8634009\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2896006","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}