{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:08:57Z","timestamp":1769285337085,"version":"3.49.0"},"reference-count":23,"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.8437865","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1700-1704","source":"Crossref","is-referenced-by-count":19,"title":["On the I\/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Hoang","family":"Dau","sequence":"first","affiliation":[{"name":"Dept. ECSE, Monash University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iwan","family":"Duursma","sequence":"additional","affiliation":[{"name":"Dept. Mathematics, UIUC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hien","family":"Chu","sequence":"additional","affiliation":[{"name":"Dept. Mathematics, HCMUE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref12","first-page":"346","article-title":"Optimal repair schemes for some families of Reed-Solomon codes","author":"dau","year":"2017","journal-title":"Proc IEEE Int Symp Inform Theory (ISIT)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2017.8023449"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262840"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006548"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262866"},{"key":"ref18","author":"ye","year":"0","journal-title":"Repairing Reed-Solomon codes Universally achieving the cut-set bound for any number of erasures"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262839"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2018.2827942","article-title":"Repairing Reed-Solomon codes with multiple erasures","author":"dau","year":"2018","journal-title":"IEEE Trans Inform Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref20","article-title":"Partial-parallel-repair (PPR): a distributed technique for repairing erasure coded storage","author":"mitra","year":"2016","journal-title":"European Conf Computer Systems (EuroSys)"},{"key":"ref22","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref21","article-title":"Rethinking erasure codes for cloud file systems: Minimizing i\/o for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref23","author":"lidl","year":"1986","journal-title":"Introduction to Finite Fields and Their Applications"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"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\/08437865.pdf?arnumber=8437865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:28Z","timestamp":1754588548000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437865","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}