{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T19:33:24Z","timestamp":1776800004173,"version":"3.51.2"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620355","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"892-896","source":"Crossref","is-referenced-by-count":103,"title":["Locally repairable codes with multiple repair alternatives"],"prefix":"10.1109","author":[{"given":"Lluis","family":"Pamies-Juarez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk D.L.","family":"Hollmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederique","family":"Oggier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010541","volume":"42","author":"colbourn","year":"2006","journal-title":"Handbook of Combinatorial Designs"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-007-9186-y"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.822737"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2008.9"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404723"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"3","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proceedings of the USENIX Annual Technical Conference (ATC)"},{"key":"2","author":"bin fan","year":"2011","journal-title":"Diskreduce Replication As A Prelude to Erasure Coding in Data-intensive Scalable Computing"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807278"},{"key":"10","article-title":"Storage codes with optimal repair locality","author":"papailiopoulos","year":"2012","journal-title":"IEEE Int Symp Inform Theory (ISIT)"},{"key":"7","author":"kamath","year":"2012","journal-title":"Codes with Local Regeneration"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"4","article-title":"High availability in dhts: Erasure coding vs replication","author":"rodrigues","year":"2005","journal-title":"Proc 1st International Workshop on Peer-to-Peer Systems (IPTPS)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089443"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","location":"Istanbul, Turkey","start":{"date-parts":[[2013,7,7]]},"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\/06620355.pdf?arnumber=6620355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:38Z","timestamp":1498074338000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620355","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}