{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:50:47Z","timestamp":1755219047665,"version":"3.43.0"},"reference-count":18,"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.8437710","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"826-830","source":"Crossref","is-referenced-by-count":5,"title":["Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets"],"prefix":"10.1109","author":[{"given":"Homayoon","family":"Hatami","sequence":"first","affiliation":[{"name":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David G.M.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Fuja","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874960"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007068"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2016.2609937"},{"key":"ref13","first-page":"206","article-title":"Avoiding trapping sets in SC-LDPC codes under windowed decoding","author":"beemer","year":"2016","journal-title":"Proc 2016 Int Symp Inf Theory and Its Applications (ISITA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262805"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.07.100427"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.112313.120917"},{"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","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 2003 Allerton Conf Communications Control and Computing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541757"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"2181","DOI":"10.1109\/18.782171","article-title":"Time-varying periodic convolutional codes with low-density parity-check matrix","volume":"45","author":"jimenez felstrom","year":"1999","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","first-page":"545","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes"}],"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\/08437710.pdf?arnumber=8437710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:25Z","timestamp":1754502985000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437710","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}