{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:50:44Z","timestamp":1755219044776,"version":"3.43.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437683","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1365-1369","source":"Crossref","is-referenced-by-count":0,"title":["A Class of Low-Complexity Codes Based on Doubly Recursive Block Markov Superposition Transmission"],"prefix":"10.1109","author":[{"given":"Shancheng","family":"Zhao","sequence":"first","affiliation":[{"name":"Jinan University, College of Information Science and Technology, Guangzhou, China"}]},{"given":"Xiao","family":"Ma","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, School of Data and Computer Science, Guangzhou, China"}]},{"given":"Qin","family":"Huang","sequence":"additional","affiliation":[{"name":"Beihang University, School of Electronic and Information Engineering, Beijing, China"}]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[{"name":"Xidian University, State Key Laboratory of ISN, Xi'an, China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"201","article-title":"Coding theorems for ‘turbo-like’ codes","volume":"36","author":"divsalar","year":"1998","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504277"},{"key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006883"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2016.7593067"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2397433"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033865"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6852099"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620412"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613107"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2611670"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"3150","DOI":"10.1109\/TIT.2015.2422296","article-title":"Block Markov superposition transmission: Construction of big convolutional codes from short codes","volume":"61","author":"ma","year":"2015","journal-title":"IEEE Trans Inform Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006883"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437683.pdf?arnumber=8437683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:21Z","timestamp":1754502981000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437683","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}