{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:41Z","timestamp":1776956081513,"version":"3.51.4"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834604","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3262-3267","source":"Crossref","is-referenced-by-count":12,"title":["Bandwidth Cost of Code Conversions in the Split Regime"],"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":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437700"},{"key":"ref14","first-page":"213","article-title":"A tale of two erasure codes in HDFS","author":"xia","year":"0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174041"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.150"},{"key":"ref17","first-page":"149","article-title":"Fastscale: accelerate RAID scaling by minimizing data migration","author":"zheng","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.32"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.143"},{"key":"ref28","first-page":"1","article-title":"NCScale: toward optimal storage scaling via network coding","author":"hu","year":"2021","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref4","first-page":"15","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"0"},{"key":"ref27","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 July 6-9 2020"},{"key":"ref3","article-title":"HDFS RAID - Facebook","author":"borthakur","year":"0"},{"key":"ref6","first-page":"345","article-title":"Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity","author":"kadekodi","year":"0"},{"key":"ref29","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":"ref5","article-title":"Apache hadoop: HDFS erasure coding","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref7","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 January 12-14 2020 Seattle Washington USA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518121"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834604"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2326156"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485961"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2505722"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989822"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437684"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176787"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282702"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834604.pdf?arnumber=9834604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:36Z","timestamp":1773347796000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834604","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}