{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:45Z","timestamp":1776956085289,"version":"3.51.4"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tit.2017.2715043","type":"journal-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T21:39:40Z","timestamp":1497562780000},"page":"1-1","source":"Crossref","is-referenced-by-count":55,"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":"ref39","year":"2017","journal-title":"Apache Hadoop Release 3 0 0-Alpha1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref33","first-page":"1606","article-title":"Codes with local regeneration","author":"kamath","year":"2013","journal-title":"Proc Inf Theory Appl Workshop (ITA)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2480848"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"ref28","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811054"},{"key":"ref2","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/2740070.2626325","article-title":"A Hitchhiker’s guide to fast and efficient data reconstruction in erasure-coded data centers","author":"rashmi","year":"2014","journal-title":"Proc ACM Sigcomm"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.137"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref25","first-page":"20","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":"ref10","year":"2017","journal-title":"HDFS RAID"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"key":"ref6","first-page":"1","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proc USENIX Symp on Operating System Design and Implementation"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref7","year":"2017","journal-title":"HDFS and Erasure Codes (HDFS-RAID)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"ref9","year":"2017","journal-title":"Facebook’s Approach to Big Data Storage Challenge"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472524"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620354"},{"key":"ref43","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth","author":"rashmi","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/4667673\/07949040.pdf?arnumber=7949040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:13Z","timestamp":1649444053000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7949040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2715043","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}