{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T00:48:12Z","timestamp":1784594892751,"version":"3.55.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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,9]]},"DOI":"10.1109\/tit.2012.2202211","type":"journal-article","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T18:02:40Z","timestamp":1338573760000},"page":"5972-5984","source":"Crossref","is-referenced-by-count":4,"title":["Reweighted LP Decoding for LDPC Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Amin","family":"Khajehnejad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Vigoda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Bradley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879405"},{"key":"ref11","article-title":"Loop calculus helps to improve belief propagation and linear programming decoding of LDPC codes","author":"chertkov","year":"2006","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394826"},{"key":"ref17","first-page":"3039","volume":"58","author":"dimakis","year":"2012","journal-title":"LDPC Codes for Compressed Sensing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502258102"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023735"},{"key":"ref4","article-title":"MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches","author":"wainwright","year":"2002","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref3","article-title":"Linear programming-based decoding of turbo-like codes and its relation to iterative approaches","author":"feldman","year":"2002","journal-title":"Annual Allerton Conf Communication Control and Computing"},{"key":"ref6","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Int Conf Turbo Codes Related Topics"},{"key":"ref29","year":"0"},{"key":"ref5","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"3rd Int Symp Turbo Codes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262071"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref1","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref20","article-title":"Improved sparse recovery thresholds with two-Step reweighted <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{1}$<\/tex> <\/formula> minimization","author":"khajehnejad","year":"2010","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518375"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref26","article-title":"On sharp performance bounds for robust sparse signal recoveries","author":"xu","year":"2009","journal-title":"Int Symp Inf Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6268384\/06210385.pdf?arnumber=6210385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:54:12Z","timestamp":1633910052000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6210385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":29,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2202211","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}