{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T12:18:36Z","timestamp":1761999516049,"version":"build-2065373602"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/tit.2017.2766238","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T19:39:48Z","timestamp":1508960388000},"page":"205-224","source":"Crossref","is-referenced-by-count":15,"title":["Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4314-0081","authenticated-orcid":false,"given":"Lei M.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4455-3825","authenticated-orcid":false,"given":"Dmitri","family":"Truhachev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4274-1785","authenticated-orcid":false,"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"The k-cores of a graph","year":"2010","author":"bickle","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20040"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20061"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844080"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.041077"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2717838"},{"key":"ref15","first-page":"2114","article-title":"Deterministic and ensemble-based spatially-coupled product codes","author":"h\u00e4ger","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689783"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513595"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2422816"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797558"},{"key":"ref4","first-page":"2398","article-title":"Iterative hard-decision decoding of braided BCH codes for high-speed optical communication","author":"jian","year":"2013","journal-title":"Proc Global Commun Conf (GLOBECOM)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033993"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018350"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523647"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874961"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.121410.090146"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313069"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228046"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313083"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2175479"},{"article-title":"On the analysis of spatially-coupled GLDPC codes and the weighted min-sum algorithm","year":"2013","author":"jian","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009580"},{"key":"ref26","article-title":"The differential equation method for random graph processes and greedy algorithms","author":"wormald","year":"1997","journal-title":"Notes for Summer School Randomized Algorithms"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0036"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8232491\/08082562.pdf?arnumber=8082562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:56Z","timestamp":1642004756000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8082562\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2766238","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}