Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

40

CORR
2010
Springer

favoriteEmaildiscussreport

156views Education» more CORR 2010»

On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage

13 years 11 months ago

On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage

Download www.eecs.berkeley.edu

The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n, k, d) Exact-Repair MDS codes, which allow

Changho Suh, Kannan Ramchandran

Real-time Traffic

CORR 2010 | Education | Erasure Codes | Maximum Distance | Repair |

claim paper

Related Content

» Distributed Storage Codes Meet MultipleAccess Wiretap Channels

» STAR An Efficient Coding Scheme for Correcting Triple Storage Node Failures

» Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits

» HeterogeneityAware Erasure Codes for PeertoPeer Storage Systems

» ComputationEfficient Multicast Key Distribution

» Towards the design of optimal data redundancy schemes for heterogeneous cloud storage infr...

» PRINS Optimizing Performance of Reliable Internet Storages

» Scalable similarity search with optimized kernel hashing

» Reflex using lowpower processors in smartphones without knowing them

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Changho Suh, Kannan Ramchandran

Comments (0)