{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:53:53Z","timestamp":1771700033240,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033733","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"1240-1244","source":"Crossref","is-referenced-by-count":52,"title":["MDS array codes with optimal rebuilding"],"prefix":"10.1109","author":[{"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"ref12","article-title":"Exact regeneration codes for distributed storage repair using interference alignment","author":"suh","year":"2010","journal-title":"Tech Rep arXiv 1001 0107"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"ref14","article-title":"On the existence of optimal exact-repair MDS codes for distributed storage","author":"suh","year":"2010","journal-title":"Tech Rep arXiv 1004 4663"},{"key":"ref15","article-title":"Distributed data storage with minimum storage regenerating codes – exact and functional repair are asymptotically equally efficient","author":"cadambe","year":"2010","journal-title":"Tech Rep arXiv 1004 4299"},{"key":"ref16","article-title":"Enabling node repair in any erasure code for distributed storage","author":"rashmi","year":"2010","journal-title":"Tech Rep arXiv 1101 0133"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811054"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.782102"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70830"},{"key":"ref5","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proceedings of the Third USENIX Symposium on File and Storage Technologies (FAST 04)"},{"key":"ref8","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"Allerton Conference on Control Computing and Communication"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206008"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","location":"St. Petersburg, Russia","start":{"date-parts":[[2011,7,31]]},"end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033733.pdf?arnumber=6033733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:34:30Z","timestamp":1490067270000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033733","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}