{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:08:49Z","timestamp":1761059329939},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"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 Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tit.2012.2201344","type":"journal-article","created":{"date-parts":[[2012,5,29]],"date-time":"2012-05-29T15:35:24Z","timestamp":1338305724000},"page":"5042-5058","source":"Crossref","is-referenced-by-count":40,"title":["Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing"],"prefix":"10.1109","volume":"58","author":[{"given":"Fan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref30","author":"baron","year":"2005","journal-title":"Distributed Compressed Sensing"},{"key":"ref37","article-title":"List-message passing achieves capacity on the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>-ary symmetric channel for large <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"zhang","year":"2007","journal-title":"presented at the IEEE Global Telecommun Conf"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842571"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref27","article-title":"Measurements vs. bits: Compressed sensing meets information theory","author":"sarvotham","year":"2006","journal-title":"presented at the 44th Annu Allerton Conf Commun Control Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.95"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1109\/ALLERTON.2008.4797558","article-title":"Counter braids: Asymptotic optimality of the message passing decoding algorithm","author":"lu","year":"2008","journal-title":"46th Annu Allerton Conf Commun Control Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503228"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502258102"},{"key":"ref50","doi-asserted-by":"crossref","DOI":"10.1090\/text\/020","author":"boas","year":"2010","journal-title":"Invitation to Complex Analysis"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref55","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-008-9031-3"},{"key":"ref10","author":"sarvotham","year":"2006","journal-title":"Compressed Sensing Reconstruction Via Belief Propagation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2027773"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601055"},{"key":"ref14","article-title":"On the iterative decoding of high rate LDPC codes with applications in compressed sensing","author":"zhang","year":"2008","journal-title":"46th Annu Allerton Conf Commun Control Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016024"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839499"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165813"},{"key":"ref18","author":"berinde","year":"2008","journal-title":"Sparse recovery using sparse matrices Technical Report"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref6","author":"cohen","year":"2006","journal-title":"Compressed sensing and best k-term approximation"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250824"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1070\/SM1984v048n01ABEH002667"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz maps into Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261573"},{"key":"ref46","author":"khajehnejad","year":"2009","journal-title":"Sparse recovery of positive signals with minimal expansion"},{"key":"ref45","article-title":"Low-density parity-check codes with rates very close to the capacity of the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>-ary symmetric channel for large <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"shokrollahi","year":"0","journal-title":"Personal communication"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095820"},{"key":"ref42","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc Int Symp Applicable Algebra Eng Commun Comput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/26.539759"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6236318\/06205393.pdf?arnumber=6205393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:54:04Z","timestamp":1633910044000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6205393\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":55,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2201344","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}