{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:09Z","timestamp":1740133029756,"version":"3.37.3"},"reference-count":8,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91438109","61401507","61571464"],"award-info":[{"award-number":["91438109","61401507","61571464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/lcomm.2016.2518163","type":"journal-article","created":{"date-parts":[[2016,1,15]],"date-time":"2016-01-15T02:41:05Z","timestamp":1452825665000},"page":"434-437","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing Completion Time for Relay-Assisted Multicast With Instantly Decodable Network Coding"],"prefix":"10.1109","volume":"20","author":[{"given":"Liang","family":"Gou","sequence":"first","affiliation":[]},{"given":"Gengxin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhengguo","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Dongming","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Zhidong","family":"Xie","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/JSAC.2009.090615"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/WCL.2014.022814.140067"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.4304\/jcm.6.8.610-617"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ICCCN.2011.6005824"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TVT.2013.2281392"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/PIMRC.2013.6666427"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TVT.2008.927729"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TCOMM.2013.102313.110741"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7428996\/7383264.pdf?arnumber=7383264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:28Z","timestamp":1642003348000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7383264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":8,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2016.2518163","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}