{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:26Z","timestamp":1773377666134,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER-1943409,CNS-1956271"],"award-info":[{"award-number":["CAREER-1943409,CNS-1956271"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005801","name":"Facebook","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518121","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2334-2339","source":"Crossref","is-referenced-by-count":7,"title":["Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions"],"prefix":"10.1109","author":[{"given":"Francisco","family":"Maturana","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Pittsburgh,PA,USA"}]},{"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Pittsburgh,PA,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437700"},{"key":"ref15","first-page":"213","article-title":"A tale of two erasure codes in HDFS","author":"xia","year":"2015","journal-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies FAST 2015"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174041"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.150"},{"key":"ref18","first-page":"149","article-title":"Fastscale: accelerate RAID scaling by minimizing data migration","author":"zheng","year":"2011","journal-title":"9th USENIX Conference on File and Storage Technologies"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.32"},{"key":"ref28","article-title":"On the optimal repair-scaling tradeoff in locally repairable codes","author":"wu","year":"2020","journal-title":"2020 IEEE Conference on Computer Communications INFOCOM 2020 Virtual Conference"},{"key":"ref4","year":"0","journal-title":"Apache hadoop HDFS erasure coding"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176787"},{"key":"ref3","first-page":"15","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"2012 USENIX Conference on Annual Technical Conference"},{"key":"ref6","first-page":"66:1","article-title":"Convertible codes: new class of codes for efficient conversion of coded data in distributed storage","volume":"151","author":"maturana","year":"2020","journal-title":"11th Innovations in Theoretical Computer Science Conference ITCS 2020"},{"key":"ref5","first-page":"345","article-title":"Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity","author":"kadekodi","year":"2019","journal-title":"17th USENIX Conference on File and Storage Technologies FAST 2019"},{"key":"ref8","article-title":"Bandwidth cost of code conversions in distributed storage: Fundamental limits and optimal constructions","author":"maturana","year":"2020","journal-title":"ArXiv"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref2","author":"borthakur","year":"0","journal-title":"HDFS RAID - Facebook"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.143"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2505722"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2326156"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437684"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485961"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282702"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989822"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518121.pdf?arnumber=9518121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:48Z","timestamp":1773347688000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518121\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518121","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}