{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T20:29:10Z","timestamp":1793132950713,"version":"4.5.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/tit.2010.2054295","type":"journal-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T10:46:04Z","timestamp":1282214764000},"page":"4539-4551","source":"Crossref","is-referenced-by-count":1520,"title":["Network Coding for Distributed Storage Systems"],"prefix":"10.1109","volume":"56","author":[{"given":"Alexandros G.","family":"Dimakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. Brighten","family":"Godfrey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunnan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","year":"0","journal-title":"Online Wiki Bibliography for Distributed Storage Papers"},{"key":"ref38","article-title":"anatomy of a p2p content distribution system with network coding","author":"gkantsidis","year":"2006","journal-title":"IPTPS"},{"key":"ref33","article-title":"efficient replica maintenance for distributed storage systems","author":"chun","year":"2006","journal-title":"Symp Networked Systems Design and Implementation (NSDI)"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1145\/1151659.1159931","article-title":"minimizing churn in distributed systems","author":"godfrey","year":"2006","journal-title":"ACM SIGCOMM"},{"key":"ref31","article-title":"on object maintenance in peer-to-peer systems","author":"tati","year":"2006","journal-title":"IPTPS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"ref37","article-title":"a measurement study of peer-to-peer file sharing systems","author":"saroiu","year":"2002","journal-title":"MMCN"},{"key":"ref36","article-title":"an experimental study of the skype peer-to-peer voip system","author":"guha","year":"2006","journal-title":"IPTPS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339345"},{"key":"ref34","author":"stribling","year":"0","journal-title":"Planetlab all pairs ping"},{"key":"ref10","article-title":"high availability in dhts: erasure coding vs. replication","author":"rodrigues","year":"2005","journal-title":"IPTPS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref40","author":"bang-jensen","year":"2001","journal-title":"Digraphs Theory Algorithms and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70830"},{"key":"ref17","article-title":"weaver codes: highly fault tolerant erasure codes for storage systems","author":"hafner","year":"2005","journal-title":"FAST-2005 4th Usenix Conf File and Storage Technologies"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311882"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262068"},{"key":"ref4","article-title":"total recall: system support for automated availability management","author":"bhagwan","year":"2004","journal-title":"Symp Networked Systems Design and Implementation (NSDI)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2006.250455"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4236.957894"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874535"},{"key":"ref5","article-title":"designing a dht for low latency and high throughput","author":"dabek","year":"2004","journal-title":"Symp Networked Systems Design and Implementation (NSDI)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/502051.502054"},{"key":"ref8","article-title":"pond: the oceanstore prototype","author":"rhea","year":"2003","journal-title":"USENIX File and Storage Technologies (FAST)"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1145\/1151659.1159943","article-title":"growth codes: maximizing sensor network data persistence","author":"kamra","year":"2006","journal-title":"ACM SIGCOMM"},{"key":"ref2","article-title":"deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"Allerton Con Control Computing and Communication"},{"key":"ref9","article-title":"erasure coding vs. replication: a quantitiative comparison","author":"weatherspoon","year":"2002","journal-title":"Proc IPTPS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref25","article-title":"ubiquitous acess to distributed data in large-scale sensor networks through decentralized erasure codes","author":"dimakis","year":"2005","journal-title":"IEEE\/ACM Int Symposium on Information Processing in Sensor Networks (IPSN)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5550275\/05550492.pdf?arnumber=5550492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T20:43:36Z","timestamp":1633898616000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5550492\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":40,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2054295","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}