450 research outputs found
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
We present the construction of a new family of erasure correcting codes for
distributed storage that yield low repair bandwidth and low repair complexity.
The construction is based on two classes of parity symbols. The primary goal of
the first class of symbols is to provide good erasure correcting capability,
while the second class facilitates node repair, reducing the repair bandwidth
and the repair complexity. We compare the proposed codes with other codes
proposed in the literature.Comment: Accepted, will appear in the proceedings of Globecom 2015 (Selected
Areas in Communications: Data Storage
Partial MDS Codes with Local Regeneration
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes
that combine locality with strong erasure correction capabilities. We construct
PMDS and SD codes where each local code is a bandwidth-optimal regenerating MDS
code. The constructions require significantly smaller field size than the only
other construction known in literature
Optimal Locally Repairable Codes via Rank-Metric Codes
This paper presents a new explicit construction for locally repairable codes
(LRCs) for distributed storage systems which possess all-symbols locality and
maximal possible minimum distance, or equivalently, can tolerate the maximal
number of node failures. This construction, based on maximum rank distance
(MRD) Gabidulin codes, provides new optimal vector and scalar LRCs. In
addition, the paper also discusses mechanisms by which codes obtained using
this construction can be used to construct LRCs with efficient repair of failed
nodes by combination of LRC with regenerating codes
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
This paper aims to go beyond resilience into the study of security and
local-repairability for distributed storage systems (DSS). Security and
local-repairability are both important as features of an efficient storage
system, and this paper aims to understand the trade-offs between resilience,
security, and local-repairability in these systems. In particular, this paper
first investigates security in the presence of colluding eavesdroppers, where
eavesdroppers are assumed to work together in decoding stored information.
Second, the paper focuses on coding schemes that enable optimal local repairs.
It further brings these two concepts together, to develop locally repairable
coding schemes for DSS that are secure against eavesdroppers.
The main results of this paper include: a. An improved bound on the secrecy
capacity for minimum storage regenerating codes, b. secure coding schemes that
achieve the bound for some special cases, c. a new bound on minimum distance
for locally repairable codes, d. code construction for locally repairable codes
that attain the minimum distance bound, and e. repair-bandwidth-efficient
locally repairable codes with and without security constraints.Comment: Submitted to IEEE Transactions on Information Theor
- …