{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T20:05:49Z","timestamp":1725393949683},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620474","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1486-1490","source":"Crossref","is-referenced-by-count":2,"title":["Linear programming decoding of spatially coupled codes"],"prefix":"10.1109","author":[{"given":"Louay","family":"Bazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badih","family":"Ghazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudiger","family":"Urbanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes","year":"2005","author":"vontobel","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030477"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"12","first-page":"1","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Turbo Codes&Related Topics 6th International ITG-Conference on Source and Channel Coding (TURBOCODING) 2006 4th International Symposium On VDE"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284229"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033863"},{"year":"2011","author":"burshtein","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"5","first-page":"75","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proceedings of the IEEE International Symposium on Turbo Codes and Applications"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557569"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620474"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620474.pdf?arnumber=6620474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T23:23:53Z","timestamp":1490225033000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620474\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620474","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}