{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T12:03:30Z","timestamp":1725710610724},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513600","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"719-723","source":"Crossref","is-referenced-by-count":1,"title":["On the typical minimum distance of protograph-based generalized LDPC codes"],"prefix":"10.1109","author":[{"given":"Shadi","family":"Abu-Surra","sequence":"first","affiliation":[]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[]},{"given":"William E.","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050600"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2007.4357601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.287"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref16","article-title":"Weight distributions of LDPC code ensembles: combinatorics meets statistical physics","author":"di","year":"2004","journal-title":"IEEE Int Symp on Inform Theory"},{"key":"ref17","article-title":"Quasi cyclic LDPC codes: Influence of proto- and Tanner-graph structure on minimum Hamming distance upper bounds","author":"smarandache","year":"2009","journal-title":"IEEE Trans on Inform"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513638"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880065"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262129"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISSSTA.2008.154"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-density parity-check codes","author":"gallager","year":"1963"},{"key":"ref9","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"Tech Rep 42–154 IPN Progress Report"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513600.pdf?arnumber=5513600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:38:55Z","timestamp":1559446735000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513600","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}