Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs. (arXiv:1302.4670v1 [cs.IT])

from cs.IT updates on arXiv.org http://arxiv.org/abs/1302.4670

A new class of exact-repair regenerating codes is constructed by combining
two layers of erasure correction codes together with combinatorial block
designs, e.g., Steiner systems, balanced incomplete block designs and
t-designs. The proposed codes have the “uncoded repair” property where the
nodes participating in the repair simply transfer part of the stored data
directly, without performing any computation. The layered error correction
structure makes the decoding process rather straightforward, and in general the
complexity is low. We show that this construction is able to achieve
performance better than time-sharing between the minimum storage regenerating
codes and the minimum repair-bandwidth regenerating codes.



Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 更改 )

Twitter picture

You are commenting using your Twitter account. Log Out / 更改 )

Facebook photo

You are commenting using your Facebook account. Log Out / 更改 )

Google+ photo

You are commenting using your Google+ account. Log Out / 更改 )

Connecting to %s