1,179 research outputs found
High-Rate Regenerating Codes Through Layering
In this paper, we provide explicit constructions for a class of exact-repair
regenerating codes that possess a layered structure. These regenerating codes
correspond to interior points on the storage-repair-bandwidth tradeoff, and
compare very well in comparison to scheme that employs space-sharing between
MSR and MBR codes. For the parameter set with , we
construct a class of codes with an auxiliary parameter , referred to as
canonical codes. With in the range , these codes operate in
the region between the MSR point and the MBR point, and perform significantly
better than the space-sharing line. They only require a field size greater than
. For the case of , canonical codes can also be shown to
achieve an interior point on the line-segment joining the MSR point and the
next point of slope-discontinuity on the storage-repair-bandwidth tradeoff.
Thus we establish the existence of exact-repair codes on a point other than the
MSR and the MBR point on the storage-repair-bandwidth tradeoff. We also
construct layered regenerating codes for general parameter set ,
which we refer to as non-canonical codes. These codes also perform
significantly better than the space-sharing line, though they require a
significantly higher field size. All the codes constructed in this paper are
high-rate, can repair multiple node-failures and do not require any computation
at the helper nodes. We also construct optimal codes with locality in which the
local codes are layered regenerating codes.Comment: 20 pages, 9 figure
An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes
In this paper we establish an improved outer bound on the
storage-repair-bandwidth tradeoff of regenerating codes under exact repair. The
result shows that in particular, it is not possible to construct exact-repair
regenerating codes that asymptotically achieve the tradeoff that holds for
functional repair. While this had been shown earlier by Tian for the special
case of the present result holds for general . The
new outer bound is obtained by building on the framework established earlier by
Shah et al.Comment: 14 page
New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
We study the exact-repair tradeoff between storage and repair bandwidth in
distributed storage systems (DSS). We give new inner bounds for the tradeoff
region and provide code constructions that achieve these bounds.Comment: Submitted to the IEEE International Symposium on Information Theory
(ISIT) 2014. This draft contains 8 pages and 4 figure
A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes
The first focus of the present paper, is on lower bounds on the
sub-packetization level of an MSR code that is capable of carrying out
repair in help-by-transfer fashion (also called optimal-access property). We
prove here a lower bound on which is shown to be tight for the case
by comparing with recent code constructions in the literature.
We also extend our results to an MDS code over the vector alphabet.
Our objective even here, is on lower bounds on the sub-packetization level
of an MDS code that can carry out repair of any node in a subset of
nodes, where each node is repaired (linear repair) by
help-by-transfer with minimum repair bandwidth. We prove a lower bound on
for the case of . This bound holds for any and
is shown to be tight, again by comparing with recent code constructions in the
literature. Also provided, are bounds for the case .
We study the form of a vector MDS code having the property that we can repair
failed nodes belonging to a fixed set of nodes with minimum repair
bandwidth and in optimal-access fashion, and which achieve our lower bound on
sub-packetization level . It turns out interestingly, that such a code
must necessarily have a coupled-layer structure, similar to that of the Ye-Barg
code.Comment: Revised for ISIT 2018 submissio
- …