{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T23:06:36Z","timestamp":1703027196331},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1109\/lcomm.2005.1437366","type":"journal-article","created":{"date-parts":[[2005,6,7]],"date-time":"2005-06-07T15:33:40Z","timestamp":1118158420000},"page":"546-548","source":"Crossref","is-referenced-by-count":3,"title":["Optimal regular LDPC codes for the binary erasure channel"],"prefix":"10.1109","volume":"9","author":[{"given":"M.","family":"Rashidpour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.H.","family":"Jamali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref6","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","volume":"1719","author":"shokrollahi","year":"1999","journal-title":"Proc Symp Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref8","first-page":"153","volume":"123","author":"shokrollahi","year":"2000","journal-title":"Capacity-Achieving Sequences"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref9","author":"chung","year":"2000","journal-title":"On the construction of some capacity-approaching coding schemes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"}],"container-title":["IEEE Communications Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4234\/30955\/01437366.pdf?arnumber=1437366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:29:17Z","timestamp":1638217757000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1437366\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,6]]}},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2005.1437366","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}