{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T10:57:42Z","timestamp":1789901862576,"version":"4.0.1"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"973 Program","doi-asserted-by":"crossref","award":["2012CB316100"],"award-info":[{"award-number":["2012CB316100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["61172082"],"award-info":[{"award-number":["61172082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["91438101"],"award-info":[{"award-number":["91438101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tit.2015.2422296","type":"journal-article","created":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T19:07:41Z","timestamp":1428952061000},"page":"3150-3163","source":"Crossref","is-referenced-by-count":93,"title":["Block Markov Superposition Transmission: Construction of Big Convolutional Codes From Short Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Xiao","family":"Ma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chulong","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kechao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiutao","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620587"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874961"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033863"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513622"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691238"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620551"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2211995"},{"key":"ref60","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"The Research Laboratory of Electronics at the Massachusetts Institute of Technology"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122712.120225"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806140"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018350"},{"key":"ref63","first-page":"56","article-title":"Weight distributions for turbo codes using random and nonrandom permutations","author":"dolinar","year":"1995"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90835-2"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90874-7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034784"},{"key":"ref66","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref68","year":"2011","journal-title":"CCSDS 131 0-B-2 TM Synchronization and Channel Coding"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref69","article-title":"Serial concatenation of RS codes with Kite codes: Performance analysis, iterative decoding and design","author":"ma","year":"2011"},{"key":"ref1","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/26.192404"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.623140"},{"key":"ref21","first-page":"979","article-title":"Hyperimposed convolutional codes","volume":"2","author":"cheng","year":"1996","journal-title":"Proc Int Conf Commun"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/VETEC.1998.686477"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.45283"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523405"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.930920"},{"key":"ref50","article-title":"A new class of multiplerate codes based on block Markov superposition transmission","author":"liang","year":"2013"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.013114.132651"},{"key":"ref59","first-page":"94","article-title":"List decoding for noisy channels","volume":"335","author":"elias","year":"1957"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.092011.110082"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838104"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056014"},{"key":"ref53","first-page":"349","article-title":"Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)","volume":"it 22","author":"lee","year":"1976","journal-title":"IEEE Trans Inf Theory"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2012.6325212"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056357"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/4234.781010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref17","first-page":"37","article-title":"Coding for noisy channels","author":"elias","year":"1955","journal-title":"IRE Conv Rep Pt 4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.720548"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref3","author":"forney","year":"1966","journal-title":"Concatenated Codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.485713"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910590"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2366131"},{"key":"ref7","first-page":"201","article-title":"Coding theorems for ‘turbo-like’ codes","author":"divsalar","year":"1998","journal-title":"Proc Allerton Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404660"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2014.6955092"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2231465"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057042"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056847"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07084636.pdf?arnumber=7084636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:47:43Z","timestamp":1642006063000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7084636\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":69,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2422296","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}