{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T11:35:57Z","timestamp":1725449757561},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033786","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"1474-1478","source":"Crossref","is-referenced-by-count":13,"title":["Spatially coupled LDPC codes for decode-and-forward in erasure relay channel"],"prefix":"10.1109","author":[{"given":"Hironori","family":"Uchikawa","sequence":"first","affiliation":[]},{"given":"Kenta","family":"Kasai","sequence":"additional","affiliation":[]},{"given":"Kohichi","family":"Sakaniwa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"An information theory for erasure channels","author":"salamatian","year":"2005","journal-title":"43rd Annual Allerton Conference"},{"key":"ref11","first-page":"269","article-title":"On the achievability of cut-set bound for a class of erasure relay channels the non degraded case","author":"khalili","year":"2004","journal-title":"International Symposium on Information Theory and its Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904983"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513451"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5650084"},{"key":"ref16","article-title":"Low Density Parity Check (LDPC) Codes Constructed from Protographs","author":"thorpe","year":"2003","journal-title":"JPL IPN Progress Report 42-154"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2009.5044941"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613887"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034031"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref8","article-title":"Spatial coupling of capacity-achieving codes with bounded density","author":"kasai","year":"2011","journal-title":"Information Theory and Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034088"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"}],"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\/06033786.pdf?arnumber=6033786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:39:22Z","timestamp":1490053162000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033786\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033786","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}