{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:42Z","timestamp":1740131682611,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tcomm.2018.2820702","type":"journal-article","created":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T18:04:51Z","timestamp":1522346691000},"page":"3268-3280","source":"Crossref","is-referenced-by-count":11,"title":["Connections Between Low-Weight Codewords and Cycles in Spatially Coupled LDPC Convolutional Codes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-4007","authenticated-orcid":false,"given":"Massimo","family":"Battaglioni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8754-5526","authenticated-orcid":false,"given":"Marco","family":"Baldi","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Cancellieri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2211995"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502981"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523979"},{"key":"ref15","first-page":"1","article-title":"Unavoidable cycles in polynomial-based time-invariant LDPC convolutional codes","author":"zhou","year":"2011","journal-title":"Proc Eur Wireless Conf Sustain Wireless Technol"},{"journal-title":"Source code for approximating the mindist problem of LDPC codes","year":"2008","author":"mackay","key":"ref16"},{"key":"ref17","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"2004","journal-title":"Proc IEEE ICC"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SOFTCOM.2015.7314104"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref8","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033698"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2613107"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8436087\/08327849.pdf?arnumber=8327849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:16Z","timestamp":1642004596000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8327849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":20,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2820702","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}