{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:51:48Z","timestamp":1729615908828,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2004.1405302","type":"proceedings-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T15:20:51Z","timestamp":1112800851000},"page":"215-219","source":"Crossref","is-referenced-by-count":27,"title":["Results on punctured LDPC codes"],"prefix":"10.1109","author":[{"given":"H.","family":"Pishro-Nik","sequence":"first","affiliation":[]},{"given":"F.","family":"Fekri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Finite-Length Density Evolution and the Distribution of the Number of Iterations for the Binary Erasure Channel","year":"0","author":"richardson","key":"17"},{"key":"15","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finitelength analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inform Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023273"},{"key":"13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-0165-3_9","author":"shokrollahi","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"year":"0","key":"14"},{"journal-title":"Graph-based codes and iterative decoding","year":"2002","author":"khandekar","key":"11"},{"journal-title":"On the construction of some capacity-approaching coding schemes","year":"2000","author":"chung","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889701"},{"key":"2","article-title":"Optimal puncturing distributions for rate-compatible low-density parity-check codes","author":"ha","year":"2003","journal-title":"2003 IEEE International Symposium on Information Theory Yokohama Japan"},{"key":"1","article-title":"Optimal puncturing of low-density parity-check codes","author":"ha","year":"2003","journal-title":"Proc IEEE ICC"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258595"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"9","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 Volumes in Mathematics and its Applications"},{"key":"8","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"AAECC"}],"event":{"name":"2004 IEEE Information Theory Workshop","acronym":"ITW-04","location":"San Antonio, TX, USA"},"container-title":["Manufacturing Engineer"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9641\/30470\/01405302.pdf?arnumber=1405302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T01:18:05Z","timestamp":1549761485000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1405302\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw.2004.1405302","relation":{},"subject":[]}}