{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:37Z","timestamp":1761293617023,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006922","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2213-2217","source":"Crossref","is-referenced-by-count":14,"title":["Centralized multi-node repair for minimum storage regenerating codes"],"prefix":"10.1109","author":[{"given":"Marwen","family":"Zorgui","sequence":"first","affiliation":[]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.2011.2105003"},{"year":"2016","author":"rawat","journal-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ALLERTON.2016.7852289"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2016.2633411"},{"year":"2016","author":"dau","journal-title":"Repairing reed-solomon codes with multiple erasures","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TC.2014.2349518"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TIT.2017.2661313"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2013.2274265"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/INFOCOM.2014.6847953"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ITA.2016.7888191"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.2013.2241819"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2011.2159049"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ISIT.2015.7282816"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2013.2237752"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ISIT.2016.7541264"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.2012.2227110"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2010.2054295"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2011.2178588"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ALLERTON.2016.7852289"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1017\/S0963548398003411"},{"key":"ref21","volume":"1","author":"knuth","year":"1997","journal-title":"The art of computer programming"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006922.pdf?arnumber=8006922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:16:15Z","timestamp":1513178175000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006922","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}