{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:01:31Z","timestamp":1729609291403,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1109\/ciss.2007.4298277","type":"proceedings-article","created":{"date-parts":[[2007,9,6]],"date-time":"2007-09-06T20:58:05Z","timestamp":1189112285000},"page":"80-85","source":"Crossref","is-referenced-by-count":6,"title":["Erasure Codes with Small Overhead Factor and Their Distributed Storage Applications"],"prefix":"10.1109","author":[{"given":"H.","family":"Kameyama","sequence":"first","affiliation":[]},{"given":"Y.","family":"Sato","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"WEAVER Codes: Highly fault tolerant erasure codes for storage systems","author":"hafner","year":"2005","journal-title":"FAST-2005 4th Usenix Conference on File and Storage Technologies"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BFb0030690","article-title":"Secure distributed storage and retrieval","volume":"1320","author":"garay","year":"1997","journal-title":"Lecture Notes in Computer Science Distributed Algorithms Proc of 11th International Workshop WDAG'97"},{"key":"ref10","article-title":"On the Practical Use of LDPC Erasure Codes for Distributed Storage Applications","author":"plank","year":"2003","journal-title":"Technical Report CS-03–510"},{"key":"ref6","article-title":"STAR: An Efficient Coding Scheme for Correcting Triple Storage Node Failures","author":"huang","year":"2005","journal-title":"2005 USENIX Conference on File and Storage Technologies (FAST 2005)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2006.43"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.40"},{"key":"ref12","first-page":"335","volume":"36","author":"rabin","year":"1989","journal-title":"Efficient Dispersal of Information for Security Load Balancing and Fault Tolerance Journal of ACM"},{"key":"ref8","article-title":"Analysis of Random Processes via And-Or Tree Evaluation","author":"mitzenmacher","year":"1998","journal-title":"SODA ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164075"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/176979.176981"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.86"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"}],"event":{"name":"2007 41st Annual Conference on Information Sciences and Systems","start":{"date-parts":[[2007,3,14]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2007,3,16]]}},"container-title":["2007 41st Annual Conference on Information Sciences and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4298256\/4298257\/04298277.pdf?arnumber=4298277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T22:39:34Z","timestamp":1497739174000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4298277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ciss.2007.4298277","relation":{},"subject":[],"published":{"date-parts":[[2007,3]]}}}