{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:04:38Z","timestamp":1761293078996},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620242","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"331-335","source":"Crossref","is-referenced-by-count":42,"title":["A piggybacking design framework for read-and download-efficient distributed storage codes"],"prefix":"10.1109","author":[{"given":"K. V.","family":"Rashmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nihar B.","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"journal-title":"Codes with Local Regeneration","year":"2012","author":"kamath","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"1","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":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811054"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"4","article-title":"Permutation code: Optimal exactrepair of a single failed node in MDS code based distributed storage systems","author":"cadambe","year":"2011","journal-title":"IEEE ISIT"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"key":"8","article-title":"Rethinking erasure codes for cloud file systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"USENIX FAST"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620242.pdf?arnumber=6620242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T16:59:21Z","timestamp":1490201961000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620242\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620242","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}