{"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":1775120124039,"version":"3.50.1"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"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":[[2008,12]]},"DOI":"10.1109\/tit.2008.2006384","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T21:30:00Z","timestamp":1228167000000},"page":"5396-5410","source":"Crossref","is-referenced-by-count":89,"title":["Adaptive Methods for Linear Programming Decoding"],"prefix":"10.1109","volume":"54","author":[{"given":"Mohammad H.","family":"Taghavi N.","sequence":"first","affiliation":[]},{"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262070"},{"key":"ref11","first-page":"31","article-title":"loop calculus helps to improve belief propagation and linear programming decoding of ldpc codes","author":"chertkov","year":"2006","journal-title":"Proc Allerton Conf Communications Control and Computing"},{"key":"ref12","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref13","year":"0","journal-title":"GNU Linear Programming Kit"},{"key":"ref14","year":"0","journal-title":"MOSEK Optimization Software"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"ref16","author":"gomory","year":"1958","journal-title":"An Algorithm for Integer Solutions to Linear Programs"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924700"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826644"},{"key":"ref4","author":"yedidia","year":"2002","journal-title":"Understanding belief propagation and its generalizations"},{"key":"ref3","article-title":"graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","author":"vontobel","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557412"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557442"},{"key":"ref2","first-page":"991","article-title":"on the relationship between linear programming decoding and min-sum algorithm decoding","author":"vontobel","year":"2004","journal-title":"Proc Int Symp Information Theory and Its Applications"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1184"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4675712\/04675739.pdf?arnumber=4675739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:24Z","timestamp":1638218844000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4675739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":18,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2006384","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}