{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:48:29Z","timestamp":1764784109328,"version":"3.43.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437869","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1939-1943","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Regenerating Codes for Cooperative Repair"],"prefix":"10.1109","author":[{"given":"Min","family":"Ye","sequence":"first","affiliation":[{"name":"Princeton University, Department of EE, Princeton, NJ"}]},{"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, Dept. of ECE and ISR, MD, 20742"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.2016.2633411"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ISIT.2017.8006922"},{"year":"2017","author":"ye","journal-title":"Repairing Reed-Solomon codes Universally achieving the cut-set bound for any number of erasures","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2013.2274265"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFOCOM.2014.6847953"},{"year":"2018","author":"ye","journal-title":"Cooperative repair Constructions of optimal MDS codes for all admissible parameters","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIT.2017.2661313"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.2012.2227110"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2017.2730863"},{"year":"2016","author":"sasidharan","journal-title":"An explicit coupled-layer construction of a high-rate MSR code with low sub-packetization level small field size and all-node repair","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2013.2237752"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/FOCS.2017.28"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.2011.2159049"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2010.2054295"},{"year":"2016","author":"rawat","journal-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing","key":"ref9"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437869.pdf?arnumber=8437869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:23Z","timestamp":1754588543000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437869","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}