{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:47Z","timestamp":1740131687251,"version":"3.37.3"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CCF EAGER","award":["1439725"],"award-info":[{"award-number":["1439725"]}]},{"name":"NSF CCF","award":["1116404"],"award-info":[{"award-number":["1116404"]}]},{"name":"NSF CCF","award":["1755808"],"award-info":[{"award-number":["1755808"]}]},{"name":"NSF CCF","award":["1527767"],"award-info":[{"award-number":["1527767"]}]},{"name":"MURI CHASE","award":["556016"],"award-info":[{"award-number":["556016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tit.2019.2921757","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:53:31Z","timestamp":1560214411000},"page":"6580-6619","source":"Crossref","is-referenced-by-count":14,"title":["Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes"],"prefix":"10.1109","volume":"65","author":[{"given":"Xiao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2358-0816","authenticated-orcid":false,"given":"Dong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameer","family":"Pawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1126-0292","authenticated-orcid":false,"given":"Ramtin","family":"Pedarsani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.21236\/AD0407946"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282923"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205931"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref33","article-title":"Algorithmic linear dimension reduction in the \n$\\ell_{1}$\n norm for sparse vectors","author":"gilbert","year":"2006","journal-title":"arXiv cs\/0608079"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/100816705"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033775"},{"key":"ref30","first-page":"2804","article-title":"Sudocodes \n$\\infty$\n fast measurement and reconstruction of sparse signals","author":"sarvotham","year":"2006","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205667"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601055"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286461"},{"key":"ref28","article-title":"An estimation theoretic approach for sparsity pattern recovery in the noisy setting","author":"hormati","year":"2009","journal-title":"arXiv 0911 4880"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2170116"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766202"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693287"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2864276"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref2","first-page":"4049","article-title":"Recovering \n$\\kappa$\n-sparse N-length vectors in O(K log N) time: Compressed sensing using sparse-graph codes","author":"li","year":"2016","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282735"},{"key":"ref20","first-page":"2","article-title":"Introduction to compressed sensing","volume":"93","author":"davenport","year":"2011","journal-title":"Preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595378"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146090"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046199"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025528"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283979"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201344"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283053"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483298"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518494"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797556"},{"key":"ref53","first-page":"199","article-title":"Near-optimal sparse recovery in the \n$\\ell_{1}$\n norm","author":"indyk","year":"2008","journal-title":"Proc 49th Annu IEEE Symp Found Comput Sci"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034796"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS653"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855614"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000768"},{"key":"ref16","first-page":"464","article-title":"Computing a \n$\\kappa$\n-sparse n-length discrete Fourier transform using at most 4k samples and o (k log k) complexity","author":"pawar","year":"2013","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref81","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1214\/lnms\/1215090065","article-title":"An alternative point of view on Lepski’s method","author":"birg\u00e9","year":"2001","journal-title":"Lecture Notes-Monograph Series"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001523"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205894"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852309"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/110848074"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.21391"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181819"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2000.861970"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558486"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055219"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914344"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.08.002"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-008-9031-3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173241"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8836351\/8733902-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8836351\/08733902.pdf?arnumber=8733902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:07:57Z","timestamp":1657746477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8733902\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":81,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2921757","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}