On the Optimal Minimum Distance of Fractional Repetition Codes

05/14/2020
by   Bing Zhu, et al.
0

Fractional repetition (FR) codes are a class of repair efficient erasure codes that can recover a failed storage node with both optimal repair bandwidth and complexity. In this paper, we study the minimum distance of FR codes, which is the smallest number of nodes whose failure leads to the unrecoverable loss of the stored file. We consider upper bounds on the minimum distance and present several families of explicit FR codes attaining these bounds. The optimal constructions are derived from regular graphs and combinatorial designs, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2021

Explicit Construction of Minimum Bandwidth Rack-Aware Regenerating Codes

In large data centers, storage nodes are organized in racks, and the cro...
research
08/06/2018

On the Duality and File Size Hierarchy of Fractional Repetition Codes

Distributed storage systems that deploy erasure codes can provide better...
research
02/02/2018

Load-Balanced Fractional Repetition Codes

We introduce load-balanced fractional repetition (LBFR) codes, which are...
research
05/05/2023

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes

We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon...
research
11/10/2020

Optimal Locally Repairable Codes: An Improved Bound and Constructions

We study the Singleton-type bound that provides an upper limit on the mi...
research
12/17/2019

Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage

To solve the access-balancing problem in distributed storage systems, we...
research
08/24/2020

Constructive Spherical Codes by Hopf Foliations

We present a new systematic approach to constructing spherical codes in ...

Please sign up or login with your details

Forgot password? Click here to reset