{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:25:46Z","timestamp":1769282746544,"version":"3.49.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033782","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"1457-1461","source":"Crossref","is-referenced-by-count":11,"title":["Update efficient codes for distributed storage"],"prefix":"10.1109","author":[{"family":"Ankit Singh Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Vishwanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/18.746809","article-title":"X-code: MDS array codes with optimal encoding","volume":"45","author":"xu","year":"1999","journal-title":"IEEE Tran Information Theory"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1109\/18.782102","article-title":"Low density MDS codes and factors of complete graphs","volume":"45","author":"xu","year":"1999","journal-title":"IEEE Tran Information Theory"},{"key":"ref12","article-title":"Random graphs","author":"kolchin","year":"1999"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","article-title":"The rank of sparse random matrices over finite fields","author":"bl\u00f6mer","year":"1997","journal-title":"Random Struct Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100217"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513263"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"ref8","article-title":"On the existence of optimal exact-repair MDS codes for distributed storage","author":"suh","year":"2010","journal-title":"CoRR vol abs\/1004 4663"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507931"},{"key":"ref2","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"45th Allerton Conference on Control Computing and Communication"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706931"}],"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\/06033782.pdf?arnumber=6033782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:26Z","timestamp":1497944126000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033782","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}