{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:55:24Z","timestamp":1775120124326,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706905","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T21:50:52Z","timestamp":1296769852000},"page":"180-187","source":"Crossref","is-referenced-by-count":3,"title":["Reweighted LP decoding for LDPC codes"],"prefix":"10.1109","author":[{"given":"M. Amin","family":"Khajehnejad","sequence":"first","affiliation":[]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[]},{"given":"William","family":"Bradley","sequence":"additional","affiliation":[]}],"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 Conference on Communications Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"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","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502258102"},{"key":"ref19","article-title":"Improved Sparse Recovery Thresholds with Two-Step Reweighted l1 Minimization","author":"khajehnejad","year":"2010","journal-title":"ISIT"},{"key":"ref28","article-title":"Robustness of LP and Iterative Reweighted LP Decoding","author":"khajehnejad","year":"2010"},{"key":"ref4","article-title":"MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches","author":"wainwright","year":"2002","journal-title":"Proc Allerton Conference on Communication Control and Computing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023735"},{"key":"ref3","article-title":"Linear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches","author":"feldman","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref6","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Proc Int Conf on Turbo Codes and 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":"Proc 3rd International Symp on 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","article-title":"Decoding Error-Correcting Codes via Linear Programming","author":"feldman","year":"2003"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref24","first-page":"211231","article-title":"Compressed sensing and best k-term approximation","volume":"22","author":"cohen","year":"2009","journal-title":"Journal of the American Mathematical Society"},{"key":"ref23","article-title":"Compressed sensing – probabilistic analysis of a null-space characterization","author":"stojnic","year":"0","journal-title":"IEEE International Conference on Acoustic Speech and Signal Processing ICASSP 2008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref25","article-title":"On Sharp Performance Bounds for Robust Sparse Signal Recoveries","author":"xu","year":"0","journal-title":"International Symposium on Information Theory 2009"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2010,9,29]]},"end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706905.pdf?arnumber=5706905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T06:32:10Z","timestamp":1490077930000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706905\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706905","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}