{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T12:44:42Z","timestamp":1744029882400},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262802","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"672-679","source":"Crossref","is-referenced-by-count":19,"title":["A generalized algebraic approach to optimizing SC-LDPC codes"],"prefix":"10.1109","author":[{"given":"Allison","family":"Beemer","sequence":"first","affiliation":[]},{"given":"Salman","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Christine A.","family":"Kelley","sequence":"additional","affiliation":[]},{"given":"Joerg","family":"Kliewer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Analysis and design of protograph based LDPC codes and ensembles","year":"2005","author":"thorpe","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007068"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006818"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095211"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797704"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874960"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2231465"},{"key":"ref6","first-page":"206","article-title":"Avoiding trapping sets in SC-LDPC codes under windowed decoding","author":"beemer","year":"2016","journal-title":"2016 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282415"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2597287"},{"key":"ref7","first-page":"2000","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"2nd Int Symp Turbo Codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503166"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"journal-title":"Topological Graph Theory","year":"2001","author":"gross","key":"ref9"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262802.pdf?arnumber=8262802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T21:59:29Z","timestamp":1519855169000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262802","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}