{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:50:09Z","timestamp":1744905009290},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/lcomm.2016.2569579","type":"journal-article","created":{"date-parts":[[2016,5,17]],"date-time":"2016-05-17T18:09:08Z","timestamp":1463508548000},"page":"1487-1490","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Algorithm to Improve the Success Threshold of Node-Based Verification-Based Algorithms in Compressed Sensing"],"prefix":"10.1109","volume":"20","author":[{"given":"Sara","family":"Khosravi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Asvadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Ahmadian-Attari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref11","first-page":"2804","article-title":"Sudocodes—Fast measurement and reconstruction of sparse signals","author":"sarvotham","year":"2006","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref12","article-title":"Finite length analysis of verification-based message passing algorithms in compressed sensing","author":"farhangdoust","year":"2015"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025573"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201344"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2206368"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6281807"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165813"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006466"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7539712\/07470554.pdf?arnumber=7470554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:49Z","timestamp":1642003369000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7470554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":13,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2016.2569579","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}