Erasure code

Results: 51



#Item
1RJ10391 (A0610-035) October 24, 2006 Computer Science IBM Research Report Notes on Reliability Models for Non-MDS Erasure Codes James Lee Hafner, KK Rao

RJ10391 (A0610-035) October 24, 2006 Computer Science IBM Research Report Notes on Reliability Models for Non-MDS Erasure Codes James Lee Hafner, KK Rao

Add to Reading List

Source URL: domino.watson.ibm.com

Language: English - Date: 2006-10-25 15:57:28
21  Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads John W. Byers Dept. of Computer Science

1 Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads John W. Byers Dept. of Computer Science

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English
31  Zigzag Codes: MDS Array Codes with Optimal Rebuilding Itzhak Tamo∗ † , Zhiying Wang∗ , and Jehoshua Bruck∗ Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA

1 Zigzag Codes: MDS Array Codes with Optimal Rebuilding Itzhak Tamo∗ † , Zhiying Wang∗ , and Jehoshua Bruck∗ Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA

Add to Reading List

Source URL: paradise.caltech.edu

Language: English - Date: 2012-01-09 16:57:54
4LT Codes Michael Luby Digital Fountain, Inc.   Abstract

LT Codes Michael Luby Digital Fountain, Inc. Abstract

Add to Reading List

Source URL: www.scs.stanford.edu

Language: English - Date: 2008-05-16 19:00:48
5Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat  Esther Ezra

Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

Add to Reading List

Source URL: www.cims.nyu.edu

Language: English - Date: 2013-07-29 14:22:26
6Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth KV Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, and Kannan Ramchandran, University of California, Berkel

Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth KV Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, and Kannan Ramchandran, University of California, Berkel

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2015-06-10 01:10:30
71  Network Coding for Distributed Storage Systems Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu, Martin Wainwright and Kannan Ramchandran

1 Network Coding for Distributed Storage Systems Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu, Martin Wainwright and Kannan Ramchandran

Add to Reading List

Source URL: users.ece.utexas.edu

Language: English - Date: 2013-01-22 04:13:37
8Steganography via Codes for Memory with Defective Cells Jessica Fridricha , Miroslav Goljana , and David Soukalb a Department  of Electrical and Computer Engineering,

Steganography via Codes for Memory with Defective Cells Jessica Fridricha , Miroslav Goljana , and David Soukalb a Department of Electrical and Computer Engineering,

Add to Reading List

Source URL: www.ws.binghamton.edu

Language: English - Date: 2006-04-26 08:10:09
9A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries For Storage James S. Plank University of Tennessee  Jianqiang Luo

A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries For Storage James S. Plank University of Tennessee Jianqiang Luo

Add to Reading List

Source URL: nisl.wayne.edu

Language: English - Date: 2014-12-04 18:23:57
10Erasure Coding in Windows Azure Storage Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin Microsoft Corporation Abstract Windows Azure Storage (WAS) is a clo

Erasure Coding in Windows Azure Storage Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin Microsoft Corporation Abstract Windows Azure Storage (WAS) is a clo

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2015-05-31 09:53:46