{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:13Z","timestamp":1772283493361,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875271","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"2435-2439","source":"Crossref","is-referenced-by-count":2,"title":["Repairable Block Failure Resilient codes"],"prefix":"10.1109","author":[{"given":"Gokhan","family":"Calis","sequence":"first","affiliation":[]},{"given":"O. Ozan","family":"Koyluoglu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","author":"mcwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"},{"key":"18","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"16","article-title":"A realistic distributed storage system: The rack model","author":"gaston","year":"2013","journal-title":"CoRR"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"14","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proceedings of the Fifth USENIX Symposium on Operating Systems Design and Implementation"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"12","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annual Technical Conference"},{"key":"21","author":"stinson","year":"2004","journal-title":"Combinatorial Designs Construction and Analysis"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620277"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"9","article-title":"Codes with local regeneration","author":"kamath","year":"2012","journal-title":"CoRR"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"}],"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\/06875271.pdf?arnumber=6875271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:20:44Z","timestamp":1602688844000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875271","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}