{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:35:30Z","timestamp":1729672530813,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706931","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T16:50:52Z","timestamp":1296751852000},"page":"376-382","source":"Crossref","is-referenced-by-count":24,"title":["Update-efficient codes for erasure correction"],"prefix":"10.1109","author":[{"given":"N. Prasanth","family":"Anthapadmanabhan","sequence":"first","affiliation":[]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[]},{"given":"Sriram","family":"Vishwanath","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"How good is random linear coding based distributed networked storage 7","author":"acedanski","year":"2005","journal-title":"Proc 2nd Workshop on Network Coding (NetCod'05)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2007.4480101"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/JSAC.2010.100215","article-title":"Decentralized coding algorithms for distributed storage in wireless sensor networks","volume":"28","author":"kong","year":"2010","journal-title":"IEEE J Sel A Commun"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref18","article-title":"R5XO: An efficient high distance parity-based code with optimal update complexity","author":"hartline","year":"2004","journal-title":"IBM Research Report RJ 10322 (A0408–005)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542326"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/AICT-ICIW.2006.90"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874535"},{"key":"ref6","article-title":"Erasure codes for storage applications","author":"plank","year":"2005","journal-title":"Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST '05)"},{"key":"ref5","first-page":"15","article-title":"Star: An efficient coding scheme for correcting triple storage node failures","author":"huang","year":"2005","journal-title":"Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST '05)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262068"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002909"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2005.1440909"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-45748-8_31","article-title":"Erasure coding vs. replication: a quantitive comparision","author":"weatherspoon","year":"2002","journal-title":"Proc 1st International Workshop on Peer-to-Peer Systems (IPTPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2006.250455"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"ref22","article-title":"Random Graphs","volume":"53","author":"kolchin","year":"1999","journal-title":"ser Encyclopedia of Mathematics and its Applications"},{"key":"ref21","article-title":"Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes","author":"smith","year":"2006","journal-title":"IACR Eprint Report 2009\/206"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706931.pdf?arnumber=5706931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T15:22:10Z","timestamp":1497885730000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706931","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}