{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:51Z","timestamp":1740133011059,"version":"3.37.3"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"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":["61602470","21603008"],"award-info":[{"award-number":["61602470","21603008"]}],"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":[[2017,9]]},"DOI":"10.1109\/lcomm.2017.2695610","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T18:16:06Z","timestamp":1492625766000},"page":"1901-1904","source":"Crossref","is-referenced-by-count":0,"title":["Analysis on Ensemble of Regenerating Codes and Replication"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9494-7478","authenticated-orcid":false,"given":"Zimu","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiying","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth","author":"rashmi","year":"2015","journal-title":"Proc USENIX FAST"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567040"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2015.25"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566920"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_21"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2015.24"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IIAI-AAI.2016.164"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8030194\/07904680.pdf?arnumber=7904680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:55Z","timestamp":1642003495000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7904680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":9,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2017.2695610","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}