{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:55:27Z","timestamp":1775120127416,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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":[[2010,7]]},"DOI":"10.1109\/tit.2010.2048489","type":"journal-article","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T15:03:57Z","timestamp":1277305437000},"page":"3277-3289","source":"Crossref","is-referenced-by-count":35,"title":["A Separation Algorithm for Improved LP-Decoding of Linear Block Codes"],"prefix":"10.1109","volume":"56","author":[{"given":"Akin","family":"Tanatmis","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Ruzika","sequence":"additional","affiliation":[]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[]},{"given":"Mayur","family":"Punekar","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Kienle","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Wehn","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref12","year":"2003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090818"},{"key":"ref14","author":"nemhauser","year":"1988","journal-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization"},{"key":"ref15","author":"schrijver","year":"1986","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797586"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref18","article-title":"a class of group-structured ldpc codes","author":"tanner","year":"2001","journal-title":"Proc Int Conf Inf Syst Technol Appl"},{"key":"ref19","article-title":"towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Proc Int Conf Turbo Codes and Related Topics"},{"key":"ref4","article-title":"loop calculus helps to improve belief propagation and linear programming decodings of low-density-parity-check codes","author":"chertkov","year":"2006","journal-title":"Proc 44th Allerton Conf Commun Control Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595237"},{"key":"ref6","first-page":"1546","article-title":"pseudo-codeword landscape","author":"chertkov","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023735"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460090308"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref20","first-page":"75","article-title":"graph-covers and iterative decoding of finite length codes","author":"vontobel","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Topics"},{"key":"ref22","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 Inf Theory Appl"},{"key":"ref21","first-page":"70","article-title":"Lower bounds on the minimum pseudo-weight of linear codes","author":"vontobel","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915712"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879405"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5484964\/05485012.pdf?arnumber=5485012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:52Z","timestamp":1633913032000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5485012\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":24,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2048489","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}