{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:45:51Z","timestamp":1729611951160,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006883","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2018-2022","source":"Crossref","is-referenced-by-count":4,"title":["Recursive block Markov superposition transmission of short codes"],"prefix":"10.1109","author":[{"given":"Shancheng","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Qin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284212"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2422296"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504277"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439234"},{"key":"ref16","first-page":"201","article-title":"Coding theorems for “turbo-like” codes","volume":"36","author":"divsalar","year":"1998","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811907"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006883"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/18.910573","article-title":"Codes on graphs: Normal realizations","volume":"47","author":"forney","year":"2001","journal-title":"IEEE Trans Inform Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577834"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2316174"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"journal-title":"Low-Density Parity-Check Codes","year":"1962","author":"gallager","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2397433"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006883.pdf?arnumber=8006883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:19:43Z","timestamp":1570040383000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006883","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}