{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T17:39:43Z","timestamp":1769535583956,"version":"3.49.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"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":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6163054","type":"proceedings-article","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T16:31:08Z","timestamp":1331137868000},"page":"1-4","source":"Crossref","is-referenced-by-count":4,"title":["Optimal rate and maximum erasure probability LDPC codes in binary erasure channel"],"prefix":"10.1109","author":[{"given":"H.","family":"Tavakoli","sequence":"first","affiliation":[{"name":"Electrical Engineering Department K.N. Toosi University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Ahmadian","family":"Attari","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department K.N. Toosi University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Reza","family":"Peyghami","sequence":"additional","affiliation":[{"name":"Department of Mathematics K.N. Toosi University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2007.895188"},{"key":"ref11","article-title":"Special issue on Codes on Graphs and Iterative Algorithms","volume":"47","year":"2001","journal-title":"IEEE Trans on Information Theory"},{"key":"ref12","first-page":"153","article-title":"Capacity-achieving sequences","volume":"l","author":"shokrollahi","year":"2000","journal-title":"IMA Volume in Mathematics and its Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-46796-3_7","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc Symp Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021305"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595096"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.01.070451"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089360"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref5","first-page":"599","article-title":"The capacity of low-density paritycheck codes under message-passing decoding","volume":"47","author":"richardson","year":"2001","journal-title":"IEEE Trans on LT"},{"key":"ref8","first-page":"1570","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 on LT"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023273"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1182"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2011,9,28]]},"end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06163054.pdf?arnumber=6163054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T05:02:35Z","timestamp":1769490155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6163054\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6163054","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}