2,220 research outputs found
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
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
A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property
In this paper, we present a generic framework for constructing systematic
minimum storage regenerating codes with two parity nodes based on the invariant
subspace technique. Codes constructed in our framework not only contain some
best known codes as special cases, but also include some new codes with key
properties such as the optimal access property and the optimal update property.
In particular, for a given storage capacity of an individual node, one of the
new codes has the largest number of systematic nodes and two of the new codes
have the largest number of systematic nodes with the optimal update property.Comment: Accepted for publication in IEEE Transactions on Information Theor
- …