On Maximally Recoverable Local Reconstruction Codes

10/27/2017
by   Sivakanth Gopi, et al.
0

In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. An (n,r,h,a,q)-LRC is a q-ary code, where encoding is as a two stage process. In the first stage, h redundant parity symbols are generated from k data symbols. In the second stage, the k+h symbols are partitioned into sets of size r-a and each set is extended with a redundant symbols using an MDS code to form a local group. Local groups ensure that when at most a coordinates are erased, any missing coordinate can be recovered by accessing at most r-a symbols. Also, if a larger number of coordinates is erased; then missing symbols can be recovered by potentially accessing all remaining symbols. An (n,r,h,a,q)-LRC code as above is Maximally Recoverable (MR), if it corrects all erasure patterns which are information theoretically correctable given the presence of local groups. Obtaining MR LRCs over finite fields of minimal size is important in practice and has been the goal of a line of work in coding theory. In this work we make progress towards this goal. In particular, we show that when a and h are constant and r may grow, for every maximally recoverable LRC, q≥Ω_a,h(n· r^{a,h-2}). Prior to our work, there was no super-linear lower bound known on the field size of MR LRCs for any setting of parameters. We also give an optimal construction when there are two global parities (h=2) and improve existing constructions when there are three global parities (h=3).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2022

A construction of Maximally Recoverable LRCs for small number of local groups

Maximally Recoverable Local Reconstruction Codes (LRCs) are codes design...
research
12/14/2020

Improved Maximally Recoverable LRCs using Skew Polynomials

An (n,r,h,a,q)-Local Reconstruction Code is a linear code over 𝔽_q of le...
research
08/14/2018

Constructions of maximally recoverable local reconstruction codes via function fields

Local Reconstruction Codes (LRCs) allow for recovery from a small number...
research
11/05/2021

Maximally recoverable local reconstruction codes from subspace direct sum systems

Maximally recoverable local reconstruction codes (MR LRCs for short) hav...
research
01/16/2019

An Exponential Lower Bound on the Sub-Packetization of MSR Codes

An (n,k,ℓ)-vector MDS code is a F-linear subspace of (F^ℓ)^n (for some f...
research
09/28/2018

Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes

Locally repairable codes (LRCs) are considered with equal or unequal loc...
research
02/06/2018

Erasure correction of scalar codes in the presence of stragglers

Recent advances in coding for distributed storage systems have reignited...

Please sign up or login with your details

Forgot password? Click here to reset