{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:58:54Z","timestamp":1774418334264,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874919","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"681-685","source":"Crossref","is-referenced-by-count":87,"title":["Locality and availability in distributed storage"],"prefix":"10.1109","author":[{"given":"Ankit Singh","family":"Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris S.","family":"Papailiopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Vishwanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"18","author":"forbes","year":"2013","journal-title":"On the Locality of Codeword Symbols in Non-linear Codes"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542992"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"34","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"16","author":"kamath","year":"2012","journal-title":"Codes with Local Regeneration"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483348"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"20","author":"huang","year":"2012","journal-title":"Erasure Coding in Windows Azure Storage"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"23","author":"joshi","year":"2013","journal-title":"On the Delay-storage Trade-off in Content Download from Coded Distributed Storage Systems"},{"key":"24","author":"liang","year":"2013","journal-title":"Tofec Achieving Optimal Throughput-delay Trade-off of Cloud Storage Using Erasure Codes"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"26","author":"asteris","year":"2014","journal-title":"Repairable Fountain Codes"},{"key":"27","author":"tamo","year":"2013","journal-title":"A Family of Optimal Locally Recoverable Codes"},{"key":"28","author":"wang","year":"2013","journal-title":"Repair Locality with Multiple Erasure Tolerance"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"7","article-title":"In search of i\/o-optimal recovery from disk failures","author":"khan","year":"2011","journal-title":"Proc USENIX HotStorage"},{"key":"6","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 of USENIX Hot Storage"},{"key":"32","article-title":"Repairable replication-based storage systems using resolvable designs","author":"oktay","year":"2012","journal-title":"Proc of Allerton"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"31","author":"farnoud","year":"2013","journal-title":"Multipermutation Codes in the Ulam Metric for Nonvolatile Memories"},{"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":"Proc of IEEE ISIT"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874919.pdf?arnumber=6874919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T14:18:27Z","timestamp":1602685107000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874919","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}