{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:59:40Z","timestamp":1778255980357,"version":"3.51.4"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"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":["CCF-1422045"],"award-info":[{"award-number":["CCF-1422045"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1563742"],"award-info":[{"award-number":["CCF-1563742"]}],"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":[[2018,10]]},"DOI":"10.1109\/tit.2018.2810095","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T19:51:23Z","timestamp":1519761083000},"page":"6506-6525","source":"Crossref","is-referenced-by-count":49,"title":["MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9790-6500","authenticated-orcid":false,"given":"Ankit Singh","family":"Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klim","family":"Efremenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref31","article-title":"An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair","volume":"abs 1607 7335","author":"sasidharan","year":"2016","journal-title":"CoRR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref37","article-title":"Optimal repair of Reed–Solomon codes: Achieving the cut-set bound","volume":"abs 1706 112","author":"tamo","year":"2017","journal-title":"CoRR"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541264"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"ref18","first-page":"1","article-title":"Rethinking erasure codes for cloud file systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc 10th USENIX Conf File Storage Technol"},{"key":"ref19","article-title":"Hashtag erasure codes: From theory to practice","volume":"abs 1609","author":"kralevska","year":"2016","journal-title":"CoRR"},{"key":"ref28","article-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing","volume":"abs 1603 4822","author":"rawat","year":"2016","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref6","first-page":"1","article-title":"Copysets: Reducing the frequency of data loss in cloud storage","author":"cidon","year":"2013","journal-title":"Proc USENIX Conf Annu Tech Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref8","article-title":"Optimal repair schemes for some families of full-length Reed–Solomon codes","volume":"abs 1701 4120","author":"dau","year":"2017","journal-title":"CoRR"},{"key":"ref7","article-title":"Repairing Reed–Solomon codes with multiple erasures","volume":"abs 1612 1361","author":"dau","year":"2016","journal-title":"CoRR"},{"key":"ref2","article-title":"Repairing multiple failures for scalar MDS codes","volume":"abs 1707","author":"bartan","year":"2017","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref1","year":"2018","journal-title":"HDFS Architecture"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2561287"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref22","first-page":"1","article-title":"F4: Facebook warm BLOB storage system","author":"muralidhar","year":"2014","journal-title":"Proc USENIX Symp Oper Syst Design Implementation"},{"key":"ref21","author":"macwilliams","year":"1983","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref44","article-title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","volume":"abs 1605 8630","author":"ye","year":"2016","journal-title":"CoRR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8464702\/8303716-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8464702\/08303716.pdf?arnumber=8303716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:49Z","timestamp":1649444089000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8303716\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2810095","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}