{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:32Z","timestamp":1740131672616,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"DFG","award":["RU-1524\/2-1"],"award-info":[{"award-number":["RU-1524\/2-1"]}]},{"name":"DAAD\/RCN","award":["54565400"],"award-info":[{"award-number":["54565400"]}]},{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"crossref","award":["2011-596"],"award-info":[{"award-number":["2011-596"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/tcomm.2014.2329690","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T18:39:20Z","timestamp":1403203160000},"page":"2170-2182","source":"Crossref","is-referenced-by-count":5,"title":["Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes"],"prefix":"10.1109","volume":"62","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":[{"year":"1993","author":"ahuja","journal-title":"Network Flows","key":"ref32"},{"year":"1986","author":"schrijver","journal-title":"Theory of Linear and Integer Programming","key":"ref31"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1002\/9781118627372"},{"key":"ref10","article-title":"On the connection between finite graph covers, pseudo-codewords, and linear programming decoding of turbo codes","author":"rosnes","year":"0","journal-title":"Proc 4th Int Symp Turbo Codes Rel Topics"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/18.910572"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ISIT.2011.6033824"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2008.917682"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2010.2094819"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ISIT.2012.6283972"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ITW.2011.6089475"},{"key":"ref17","article-title":"A multivariate weight enumerator for tail-biting trellis pseudocodewords","author":"boston","year":"0","journal-title":"Proc Workshop Algebra Combinatorics Dyn"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/Allerton.2011.6120337"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TIT.2013.2264715"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TIT.2005.864450"},{"key":"ref4","first-page":"2013","article-title":"Stopping set analysis of 3-dimensional turbo code ensembles","author":"graell i amat","year":"0","journal-title":"Proc IEEE ISIT"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2004.839478"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.2011.2133610"},{"key":"ref6","first-page":"467","article-title":"Linear programming-based decoding of turbo-like codes and its relation to iterative approaches","author":"feldman","year":"0","journal-title":"Proc 40th Annu Allerton Conf Commun Control Comput"},{"key":"ref29","first-page":"306","article-title":"Computing the minimum distance of turbo-codes using iterative decoding techniques","author":"crozier","year":"0","journal-title":"Proc 22nd Biennial Symp Commun"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.2012.2195711"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2004.842696"},{"year":"2003","author":"feldman","journal-title":"Decoding error-correcting codes via linear programming","key":"ref7"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TCOMM.2009.09.070521"},{"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":"Computing Research Repository (CoRR)"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ICC.1993.397441"},{"year":"2008","journal-title":"3rd Generation Partnership Project Technical Specification Group Radio Access Network Evolved Universal Terrestrial Radio Access (E-UTRA) Multiplexing and Channel Coding (Release 8)","key":"ref20"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ISIT.2009.5205846"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/978-1-4613-0165-3_5"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/ITW.2009.5351212"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2007.907496"},{"key":"ref26","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"0","journal-title":"Proc 3rd Int Symp on Turbo Codes & Related Topics"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2003.811907"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/6860331\/06834828.pdf?arnumber=6834828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:19:53Z","timestamp":1642004393000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6834828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":32,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2014.2329690","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}