{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:25:03Z","timestamp":1729671903981,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/itw.2011.6089360","type":"proceedings-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T20:58:48Z","timestamp":1323205128000},"page":"125-129","source":"Crossref","is-referenced-by-count":6,"title":["Optimal rate for irregular LDPC codes in binary erasure channel"],"prefix":"10.1109","author":[{"given":"H.","family":"Tavakoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Ahmadian","family":"Attari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Reza","family":"Peyghami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023273"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2007.895188"},{"key":"ref12","article-title":"Special issue on Codes on Graphs and Iterative Algorithms","volume":"47","year":"2001","journal-title":"IEEE Trans on IT"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-0165-3_9","article-title":"Capacity-achieving sequences","volume":"123","author":"shokrollahi","year":"2000","journal-title":"IMA Volume in Math and its App"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref15","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"in Proc 13th Inter Symp on App Alg"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021305"},{"article-title":"Decoding Error-Correcting Codes via Linear Programming","year":"0","author":"feldman","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595096"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.01.070451"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref2","first-page":"1064","article-title":"Near Shannon limit error correcting coding and decoding","author":"berrou","year":"0"},{"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","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 IT"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"ref21","first-page":"491","article-title":"How to find good finite-length codes: from art towards science","volume":"18","author":"amraoui\u2019","year":"2006","journal-title":"Euro Trans on Telecomm Special Issue Special Issue on Turbo Coding"}],"event":{"name":"2011 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2011,10,16]]},"location":"Paraty, Brazil","end":{"date-parts":[[2011,10,20]]}},"container-title":["2011 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6081149\/6089351\/06089360.pdf?arnumber=6089360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:16:13Z","timestamp":1561032973000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6089360\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itw.2011.6089360","relation":{},"subject":[],"published":{"date-parts":[[2011,10]]}}}