{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:27Z","timestamp":1776956127624,"version":"3.51.4"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173947","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"577-582","source":"Crossref","is-referenced-by-count":29,"title":["Access-optimal Linear MDS Convertible Codes for All Parameters"],"prefix":"10.1109","author":[{"given":"Francisco","family":"Maturana","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S. Chaitanya","family":"Mukka","sequence":"additional","affiliation":[{"name":"BITS Pilani,Department of CS & IS,Goa,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref10","article-title":"Cluster storage systems gotta have HeART: improving storage efficiency by exploiting diskreliability heterogeneity","author":"kadekodi","year":"2019","journal-title":"USENIX FAST"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282702"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437684"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WiSPNET.2017.8299774"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437700"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref4","article-title":"HDFS RAID - Facebook","author":"borthakur","year":"0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref6","article-title":"Apache hadoop: HDFS erasure coding","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437590"},{"key":"ref5","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"Proceedings of USENIX Annual Technical Conference (ATC)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref7","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"Proc USENIX HotStorage"},{"key":"ref2","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) ser Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref9","article-title":"A Hitchhiker’s guide to fast and efficient data reconstruction in erasure-coded data centers","author":"rashmi","year":"2014","journal-title":"ACM SIGCOMM"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2796599"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173947.pdf?arnumber=9173947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:02Z","timestamp":1773347642000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173947\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173947","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}