{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:59:53Z","timestamp":1649030393249},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014,1]]},"DOI":"10.1109\/tit.2013.2284912","type":"journal-article","created":{"date-parts":[[2013,10,10]],"date-time":"2013-10-10T20:35:12Z","timestamp":1381437312000},"page":"191-211","source":"Crossref","is-referenced-by-count":2,"title":["On Decoding Irregular Tanner Codes With Local-Optimality Guarantees"],"prefix":"10.1109","volume":"60","author":[{"given":"Nissim","family":"Halabi","sequence":"first","affiliation":[]},{"given":"Guy","family":"Even","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"halabi","year":"2012","journal-title":"On Decoding Tanner Codes with Local-Optimality Guarantees"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref30","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"CoRR"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102403799"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003853"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.910593"},{"key":"ref34","first-page":"248","article-title":"Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis","author":"rosenthal","year":"2000","journal-title":"Proc 38th Allerton Conf Commun Control Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460060507"},{"key":"ref12","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839509"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.555"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref18","article-title":"On the block error probability of LP decoding of LDPC codes","author":"koetter","year":"2006","journal-title":"Proc Inaugural Workshop Center Inf Theory Appl"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/4234.1001666"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290303"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref7","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094830"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2137030"},{"key":"ref21","first-page":"460","article-title":"LP decoding achieves capacity","author":"feldman","year":"2005","journal-title":"Proc Symp Discrete Algorithms"},{"key":"ref24","author":"frey","year":"2000","journal-title":"Advanced Mean Field Methods Theory and Practice"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454077"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6690264\/06626647.pdf?arnumber=6626647","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\/6626647\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2284912","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}