{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:05Z","timestamp":1725490025650},"reference-count":6,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365246","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"209-209","source":"Crossref","is-referenced-by-count":4,"title":["Capacity-achieving ensembles for the binary erasure channel with bounded complexity"],"prefix":"10.1109","author":[{"given":"H.","family":"Pfister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Sason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Urbanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813560"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"ref5","first-page":"65","article-title":"New sequences of time erasure codes approaching channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proceedings of the 13th International Symposium on Applied Algebra Algebraic Algorithms and Error-Correcting Codes Lectures Notes in Computer Science 1719"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935864"},{"key":"ref1","first-page":"1","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc Int Symp Turbo Codes and Related Topics"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365246.pdf?arnumber=1365246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:43:15Z","timestamp":1489459395000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365246\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365246","relation":{},"subject":[]}}