How long can optimal locally repairable codes be?

07/03/2018
by   Venkatesan Guruswami, et al.
0

A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible trade-off between the dimension and distance of LRCs --- an LRC attaining this trade-off is deemed optimal. Such optimal LRCs have been constructed over alphabets growing linearly in the block length. Unlike the classical Singleton bound, however, it was not known if such a linear growth in the alphabet size is necessary, or for that matter even if the alphabet needs to grow at all with the block length. Indeed, for small code distances 3,4, arbitrarily long optimal LRCs were known over fixed alphabets. Here, we prove that for distances d > 5, the code length n of an optimal LRC over an alphabet of size q must be at most roughly O(d q^3). For the case d=5, our upper bound is O(q^2). We complement these bounds by showing the existence of optimal LRCs of length Ω_d,r(q^1+1/(d-3)/2) when d < r+2. These bounds match when d=5, thus pinning down n=Θ(q^2) as the asymptotically largest length of an optimal LRC for this case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2022

Some results on locally repairable codes with minimum distance 7 and locality 2

Locally repairable codes(LRCs) play important roles in distributed stora...
research
10/16/2019

Long Optimal or Small-Defect LRC Codes with Unbounded Minimum Distances

A code over a finite field is called locally recoverable code (LRC) if e...
research
10/16/2019

Long Optimal LRC Codes with Unbounded Localities and Unbounded Minimum Distances

A code over a finite field is called locally recoverable code (LRC) if e...
research
09/07/2023

LRCs: Duality, LP Bounds, and Field Size

We develop a duality theory of locally recoverable codes (LRCs) and appl...
research
01/09/2020

On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes

Optimal locally repairable codes with information locality are considere...
research
12/06/2018

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures

By a locally recoverable code (LRC), we will in this paper, mean a linea...
research
09/27/2022

Local Grammar-Based Coding Revisited

We revisit the problem of minimal local grammar-based coding. In this se...

Please sign up or login with your details

Forgot password? Click here to reset