ML p(r)ior | On MBR codes with replication

On MBR codes with replication

2016-01-29
1601.08190 | cs.IT
An early paper by Rashmi et. al. presented the construction of an $(n,k,d=n-1)$ MBR regenerating code featuring the inherent double replication of all code symbols and repair-by-transfer (RBT), both of which are important in practice. We first show that no MBR code can contain even a single code symbol that is replicated more than twice. We then go on to present two new families of MBR codes which feature double replication of all systematic message symbols. The codes also possess a set of $d$ nodes whose contents include the message symbols and which can be repaired through help-by-transfer (HBT). As a corollary, we obtain systematic RBT codes for the case $d=(n-1)$ that possess inherent double replication of all code symbols and having a field size of $O(n)$ in comparison with the general, $O(n^2)$ field size requirement of the earlier construction by Rashmi et. al. For the cases $(k=d=n-2)$ or $(k+1=d=n-2)$, the field size can be reduced to $q=2$, and hence the codes can be binary. We also give a necessary and sufficient condition for the existence of MBR codes having double replication of all code symbols and also suggest techniques which will enable an arbitrary MBR code to be converted to one with double replication of all code symbols.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2019-01-18
1901.06336 | cs.IT

Cooperative regenerating codes are regenerating codes designed to tradeoff storage for repair bandwi… show more
PDF

Highlights - Most important sentences from the article

2018-02-12

Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance an… show more
PDF

Highlights - Most important sentences from the article

2019-01-16
1901.05112 | cs.IT

An $(n,k,\ell)$-vector MDS code is a $\mathbb{F}$-linear subspace of $(\mathbb{F}^\ell)^n$ (for some… show more
PDF

Highlights - Most important sentences from the article

2019-01-14
1901.04419 | cs.IT

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of… show more
PDF

Highlights - Most important sentences from the article

2019-04-15

A code construction and repair scheme for optimal functional regeneration of multiple node failures … show more
PDF

Highlights - Most important sentences from the article

2018-10-10
1810.04611 | cs.IT

An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth repair for any $t~(t\!>\!1… show more
PDF

Highlights - Most important sentences from the article

2019-02-26
1902.09865 | cs.IT

This paper addresses the problem of constructing secure exact-repair regenerating codes at the MSR p… show more
PDF

Highlights - Most important sentences from the article

2018-01-18

We present the construction of a family of erasure correcting codes for distributed storage that ach… show more
PDF

Highlights - Most important sentences from the article

2019-01-18
1901.06067 | cs.IT

For high-rate maximum distance separable (MDS) codes, most early constructions can only optimally re… show more
PDF

Highlights - Most important sentences from the article

2019-01-03
1901.00911 | cs.IT

A novel coding scheme for exact repair-regenerating codes is presented in this paper. The codes prop… show more
PDF

Highlights - Most important sentences from the article

2016-04-26
1604.07671 | cs.IT

We propose a generic transformation that can convert any nonbinary $(n=k+r,k)$ maximum distance sepa… show more
PDF

Highlights - Most important sentences from the article

2012-02-06

Regenerating codes are a class of codes proposed for providing reliability of data and efficient rep… show more
PDF

Highlights - Most important sentences from the article

2012-06-17

Distributed storage systems for large-scale applications typically use replication for reliability. … show more
PDF

Highlights - Most important sentences from the article

2013-02-24

We present a new 'piggybacking' framework for designing distributed storage codes that are efficient… show more
PDF

Highlights - Most important sentences from the article

2014-09-05

In distributed storage systems, storage nodes intermittently go offline for numerous reasons. On com… show more
PDF

Highlights - Most important sentences from the article

2015-09-06

Erasure codes are being increasingly used in distributed-storage systems in place of data-replicatio… show more
PDF

Highlights - Most important sentences from the article