{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:22:34Z","timestamp":1777724554261,"version":"3.51.4"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"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":[[2013,12]]},"DOI":"10.1109\/tit.2013.2281372","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T08:32:23Z","timestamp":1378888343000},"page":"7870-7886","source":"Crossref","is-referenced-by-count":111,"title":["Decomposition Methods for Large Scale LP Decoding"],"prefix":"10.1109","volume":"59","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xishuo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stark C.","family":"Draper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Recht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref33","first-page":"1493","article-title":"Interior point decoding for linear vector channels based on convex optimization","author":"wadayama","year":"2008","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601085"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658668"},{"key":"ref30","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Int Symp Turbo Codes Related Topics"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90003-5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.102910.090490"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161920"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205741"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404695"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2076294"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref29","first-page":"169","article-title":"An augmented Lagrangian approach to constrained MAP inference","author":"martins","year":"2011","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref2","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094815"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261869"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162224"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030477"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879405"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120169"},{"key":"ref51","article-title":"Error floor approximation for LDPC codes in the AWGN channel","author":"butler","year":"2012","journal-title":"Arxiv Preprint 1202 2826"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"ref56","article-title":"A taxonomy suggested by Jonathan Yedidia in personal correspondence","author":"yedidia","year":"2012"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394484"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.080105"},{"key":"ref53","article-title":"Counting in graph covers: A combinatorial characterization of the Bethe entropy function","author":"vontobel","year":"2010","journal-title":"ArXiv e-prints"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910587"},{"key":"ref40","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref12","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Int Symp Turbo Codes Related Topics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref14","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090809"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253512"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2007.903311"},{"key":"ref4","article-title":"On the relationship between linear programming decoding and min-sum algorithm decoding","author":"vontobel","year":"2004","journal-title":"IEEE Int Symp Inf Theory and Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1184"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205786"},{"key":"ref49","article-title":"Encyclopedia of sparse graph codes","author":"mackay","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref46","author":"allen","year":"1998","journal-title":"Numerical Analysis For Applied Science"},{"key":"ref45","article-title":"Decomposition methods for large-scale linear-programming decoding","author":"barman","year":"2011","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref47","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Intl Conf Space-Time Absoluteness"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref41","article-title":"Online alternating direction method","author":"wang","year":"2012","journal-title":"Proc 11th Int Conf Machine Learning"},{"key":"ref44","author":"marshall","year":"2009","journal-title":"Inequalities Theory of Majorization and Its Applications"},{"key":"ref43","article-title":"The alternating direction method of multipliers as a message-passing algorithms","author":"yedidia","year":"2011","journal-title":"Talk Delivered Princeton Workshop Count Inference Optim"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6670132\/06595057.pdf?arnumber=6595057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:53Z","timestamp":1638218873000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6595057\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":60,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2281372","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}