{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:11:48Z","timestamp":1648980708140},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"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":[[2011,7]]},"DOI":"10.1109\/tit.2011.2146670","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T15:53:25Z","timestamp":1308671605000},"page":"4417-4426","source":"Crossref","is-referenced-by-count":10,"title":["An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC"],"prefix":"10.1109","volume":"57","author":[{"given":"Shashi Kiran","family":"Chilappagari","sequence":"first","affiliation":[]},{"given":"Michael","family":"Chertkov","sequence":"additional","affiliation":[]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref30","author":"sridhara","year":"2008","journal-title":"Personal communication"},{"key":"ref10","author":"vontobel","year":"2005","journal-title":"Graph-cover Decoding and Finite Length Analysis of Message-Passing Iterative Decoding of LDPC Codes"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.228701"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899563"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911177"},{"key":"ref15","author":"smarandache","year":"2006","journal-title":"Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes"},{"key":"ref16","author":"vontobel","year":"0","journal-title":"Papers on Pseudo-Codewords"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313079"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917682"},{"key":"ref19","article-title":"Variational inference in graphical models: the view from the marginal polytope","author":"wainwright","year":"2003","journal-title":"Allerton Conf on Communication Control and Computing"},{"key":"ref28","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"ISCTA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090804"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref5","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Communications Control and Computing"},{"key":"ref8","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref9","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Conf Turbo Codes and Related Topics"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref20","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":"Annual Allerton Conf Communication Control and Computing"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.303"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262070"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595237"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557442"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5895044\/05895058.pdf?arnumber=5895058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:52Z","timestamp":1642006432000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5895058\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":32,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2146670","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}