{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:33:44Z","timestamp":1729632824113,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033824","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"1648-1652","source":"Crossref","is-referenced-by-count":6,"title":["Polytope of correct (linear programming) decoding and low-weight pseudo-codewords"],"prefix":"10.1109","author":[{"given":"Michael","family":"Chertkov","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Stepanov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref11","article-title":"Towards low-complexity linear-programming decoding","volume":"abs cs 602088","author":"vontobel","year":"2006","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2009.2023735"},{"key":"ref13","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":"in Proc of the 44th Annual Allerton Conf on Communications Control and Computing"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ITW.2007.4313079"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/GLOCOM.2007.303"},{"key":"ref16","article-title":"Multi-stage decoding of ldpc codes","volume":"28","author":"yedidia","year":"2009","journal-title":"IEEE ISIT 2009"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2008.917682"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/JSAC.2009.090804"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/ISIT.2009.5205739"},{"key":"ref4","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"41st Annual Allerton Conf on Commun Cont and Comp"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1017\/CBO9780511791338"},{"key":"ref6","article-title":"Codes and decoding on general graphs","author":"wiberg","year":"1996","journal-title":"Ph D Univ Link&#x00F6;ping Sweden Dept Elec Eng"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1103\/PhysRevLett.95.228701"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","author":"forney","year":"2001","journal-title":"Codes and Graphical Models"},{"doi-asserted-by":"publisher","key":"ref2","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"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ISIT.2010.5513360"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1198\/0003130042836"},{"key":"ref21","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"ISCTA"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/0022-0000(91)90024-Y"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref26","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","volume":"abs cs 512078","author":"vontobel","year":"2005","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1017\/CBO9780511804441"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033824.pdf?arnumber=6033824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T16:59:10Z","timestamp":1593104350000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033824","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}