{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:51Z","timestamp":1776956091440,"version":"3.51.4"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2015814"],"award-info":[{"award-number":["2015814"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1422955"],"award-info":[{"award-number":["CCF1422955"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1618603"],"award-info":[{"award-number":["CCF1618603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1814487"],"award-info":[{"award-number":["CCF1814487"]}],"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":[[2019,5]]},"DOI":"10.1109\/tit.2018.2884075","type":"journal-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T15:09:00Z","timestamp":1543504140000},"page":"2673-2695","source":"Crossref","is-referenced-by-count":47,"title":["The Repair Problem for Reed\u2013Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1351-8880","authenticated-orcid":false,"given":"Min","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-4413","authenticated-orcid":false,"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2633411"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006922"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2856206"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref12","first-page":"2109","article-title":"MDS code constructions with small sub-packetization and near-optimal repair bandwidth","author":"guruswami","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/053","volume":"53","author":"iwaniec","year":"2004","journal-title":"Analytic Number Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2773089"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847953"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"ref18","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref19","author":"mardia","year":"2017","journal-title":"Repairing multiple failures for scalar MDS codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262840"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827942"},{"key":"ref8","first-page":"d4.1.1","article-title":"On information flow in relay networks","volume":"2","author":"el gamal","year":"1981","journal-title":"Proc IEEE Nat Telecom Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437486"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref22","author":"rawat","year":"2016","journal-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2658660"},{"key":"ref24","author":"sasidharan","year":"2016","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":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2810095"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8694135\/8552670-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8694135\/08552670.pdf?arnumber=8552670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:23:29Z","timestamp":1775287409000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8552670\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":35,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2884075","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}