{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:11Z","timestamp":1773377651435,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849509","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1732-1736","source":"Crossref","is-referenced-by-count":1,"title":["A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel"],"prefix":"10.1109","author":[{"given":"Enrico","family":"Paolini","sequence":"first","affiliation":[{"name":"DEI, University of Bologna, Cesena (FC), Italy"}]},{"given":"Gianluigi","family":"Liva","sequence":"additional","affiliation":[{"name":"KN-SAN, German Aerospace Center, Wessling, Germany"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref10","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849509"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.032013.120504"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595148"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref7","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504281"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782147"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849509.pdf?arnumber=8849509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:45Z","timestamp":1773347685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849509\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849509","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}