{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:29:01Z","timestamp":1769754541662,"version":"3.49.0"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NASA EPSCoR program","award":["NNX13AB31A"],"award-info":[{"award-number":["NNX13AB31A"]}]},{"name":"NASA EPSCoR program","award":["NNX14AN38A"],"award-info":[{"award-number":["NNX14AN38A"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/lcomm.2017.2783946","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T22:17:41Z","timestamp":1513376261000},"page":"450-453","source":"Crossref","is-referenced-by-count":21,"title":["Analysis and Design of Physical Layer Raptor Codes"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6846-8206","authenticated-orcid":false,"given":"Amrit","family":"Kharel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6995-0122","authenticated-orcid":false,"given":"Lei","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref12","article-title":"On the construction of some capacity-approaching coding schemes","author":"chung","year":"2000"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2436705"},{"key":"ref15","article-title":"Concatenated codes","author":"forney","year":"1966"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref17","first-page":"364","article-title":"Analysis of random processes via and-or tree evaluation","author":"luby","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.070095"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557262"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2606410"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.010314.131915"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925646"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8309483\/08214248.pdf?arnumber=8214248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:01Z","timestamp":1642004521000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8214248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":18,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2017.2783946","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}