{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:29:09Z","timestamp":1763105349066},"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.6620550","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1869-1873","source":"Crossref","is-referenced-by-count":2,"title":["Coded cooperation using rate-compatible spatially-coupled codes"],"prefix":"10.1109","author":[{"family":"Lai Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas E.","family":"Fuja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033865"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090806"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.825728"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2012.6325218"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2006.1611050"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033786"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2011.6134051","article-title":"Protograph-based raptor-like ldpc codes for rate compatibility with short blocklengths","author":"chen","year":"2011","journal-title":"2011 IEEE Global Communications Conference (GLOBECOM)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838089"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2012.6325196"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145470"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2009.5044941"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.050911.100303"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul","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\/06620550.pdf?arnumber=6620550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:00:53Z","timestamp":1564498853000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620550","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}