{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T17:48:18Z","timestamp":1725385698427},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205822","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"219-223","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds on the graphical complexity of finite-length LDPC codes"],"prefix":"10.1109","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838090"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91200-4"},{"key":"18","first-page":"1150","article-title":"tangential-sphere bounds on the ensemble performance ofml decoded gallager codes via their exact ensemble distance spectrum","author":"tong","year":"2008","journal-title":"Proceedings 2008 IEEE International Symposium on Communications"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021305"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1561\/0100000009"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018342"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261868"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889606"},{"key":"2","first-page":"45","article-title":"complexityoptimized low-density parity-check codes","author":"ardakani","year":"2005","journal-title":"Proceedings of the FortyThird Annual Allerton Conference on Communication Control and Computing"},{"journal-title":"LdpcOpt Software for Optimizing the Degree Distrbutions of LDPC Code Ensembles","year":"0","author":"amraoui","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928274"},{"key":"4","first-page":"1825","article-title":"capacity-achieving codes with bounded graphical complexity on noisy channels","author":"hsu","year":"2005","journal-title":"Proceedings of the Forty-Third Annual Allerton Conference on Communications Control and Computing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205822.pdf?arnumber=5205822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T16:27:01Z","timestamp":1489768021000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205822","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}