{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:36:45Z","timestamp":1773409005646,"version":"3.50.1"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"973 Program","doi-asserted-by":"crossref","award":["2013CB329204"],"award-info":[{"award-number":["2013CB329204"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Program of National Natural Science Foundation of China","award":["61223001"],"award-info":[{"award-number":["61223001"]}]},{"name":"Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["2015A02"],"award-info":[{"award-number":["2015A02"]}]},{"name":"Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["2015B02"],"award-info":[{"award-number":["2015B02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/lcomm.2015.2398412","type":"journal-article","created":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T19:35:18Z","timestamp":1422992118000},"page":"509-512","source":"Crossref","is-referenced-by-count":2,"title":["A Distributed LT Code Design for Multiple-Access Relay Networks Subject to Erasures"],"prefix":"10.1109","volume":"19","author":[{"given":"Haitao","family":"Yang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Chunming","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158583"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904982"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502561"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.091911.100189"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.040913.130187"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000060"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/ett.2798"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.061913.110585"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref9","first-page":"364","article-title":"Analysis of random processes via and-or tree evaluation","author":"luby","year":"0","journal-title":"9th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285258"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7081724\/07029656.pdf?arnumber=7029656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:41Z","timestamp":1642006361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7029656\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":12,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2015.2398412","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}