{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:08:03Z","timestamp":1761808083674,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1030\/15"],"award-info":[{"award-number":["1030\/15"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF-BSF","doi-asserted-by":"publisher","award":["2015814"],"award-info":[{"award-number":["2015814"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2010075"],"award-info":[{"award-number":["2010075"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1218005"],"award-info":[{"award-number":["CCF-1218005"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/tit.2016.2633411","type":"journal-article","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T19:31:52Z","timestamp":1480447912000},"page":"1084-1101","source":"Crossref","is-referenced-by-count":23,"title":["Optimal Rebuilding of Multiple Erasures in MDS Codes"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3339-3085","authenticated-orcid":false,"given":"Zhiying","family":"Wang","sequence":"first","affiliation":[]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Explicit constructions of optimalaccess MDS codes with nearly optimal sub-packetization","year":"2016","author":"ye","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852289"},{"article-title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","year":"2016","author":"ye","key":"ref34"},{"article-title":"Minimum storage regenerating codes for all parameters","year":"2016","author":"goparaju","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICICS.2015.7459908"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100216"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847953"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2349518"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2560013"},{"article-title":"Constructions of high-rate MSR codes over small fields","year":"2015","author":"raviv","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566803"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref8","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proc 3rd USENIX Symp File Storage Technol"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003411"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2015.7084873"},{"article-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing","year":"2016","author":"rawat","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"article-title":"An explicit, coupled-layer construction of a high-rate MSR code with low subpacketization level, small field size and all-node repair","year":"2016","author":"sasidharan","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7823065\/7762203-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7823065\/07762203.pdf?arnumber=7762203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:12Z","timestamp":1649443932000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7762203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2633411","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}