{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:00:51Z","timestamp":1761292851982},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034270","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"908-912","source":"Crossref","is-referenced-by-count":5,"title":["Design of irregular quasi-cyclic protograph codes with low error floors"],"prefix":"10.1109","author":[{"given":"Reza","family":"Asvadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Ahmadian-Attari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.08.070548"},{"key":"ref6","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conf Comm Cont and Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref7","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc ISCTA 2001"},{"key":"ref2","first-page":"876","article-title":"Capacity-appro ching proto graph codes","author":"divsalar","year":"2009","journal-title":"IEEE JSAC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071457"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034270.pdf?arnumber=6034270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:54:55Z","timestamp":1490054095000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034270","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}