{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:47:44Z","timestamp":1730274464619,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033700","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"1096-1100","source":"Crossref","is-referenced-by-count":10,"title":["Exact free distance and trapping set growth rates for LDPC convolutional codes"],"prefix":"10.1109","author":[{"given":"David G. M.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali E.","family":"Pusane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Lentmaier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2053873"},{"key":"ref11","first-page":"42","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"Jet Prop Lab INP Progress Report"},{"key":"ref12","article-title":"Algebraic Topology: an Introduction","volume":"56","author":"massey","year":"1977","journal-title":"Graduate Texts in Mathematics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0137027"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1986.1096498"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262129"},{"article-title":"Minimum Distance and Trapping Set Analysis of Protograph-based LDPC Convolutional Codes","year":"2011","author":"mitchell","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658734"},{"key":"ref18","article-title":"Ensemble trapping set enumerators for protograph-based LDPC codes","author":"abu-surra","year":"2007","journal-title":"Proc Forty-fifth Annual Allerton Conference"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205687"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2009.5044941"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909113"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513587"},{"key":"ref8","article-title":"Error-floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc Forty-first Annual Allerton Conference"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095211"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595143"}],"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\/06033700.pdf?arnumber=6033700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:07Z","timestamp":1490054407000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033700\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033700","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}