{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:05Z","timestamp":1725555305479},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033823","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"1643-1647","source":"Crossref","is-referenced-by-count":2,"title":["Pseudocodewords of linear programming decoding of 3-dimensional turbo codes"],"prefix":"10.1109","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Helmling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Graell i Amat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_5"},{"key":"ref11","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917682"},{"journal-title":"3GPP TS 36 212 V8 1 0","article-title":"3rd generation partnership project; technical specification group radio access network; evolved universal terrestrial radio access (E-UTRA); multiplexing and channel coding (release 8)","year":"2008","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839478"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864450"},{"key":"ref16","first-page":"306","article-title":"Computing the minimum distance of turbo-codes using iterative decoding techniques","author":"crozier","year":"2004","journal-title":"Proc 22th Biennial Symp Commun"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513362"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2133610"},{"article-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907496"},{"key":"ref7","article-title":"On the connection between finite graph covers, pseudo codewords, and linear programming decoding of turbo codes","author":"rosnes","year":"2006","journal-title":"Proc 5th Int Symp Turbo Codes & Rel Topics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.09.070521"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref9","article-title":"Graph-cover decoding and finite length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"0","journal-title":"IEEE Trans Inf Theory"}],"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\/06033823.pdf?arnumber=6033823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:34:41Z","timestamp":1490052881000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033823\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033823","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}