Asymptotic Bounds on the Rate of Locally Repairable Codes

10/27/2020
by   Ron M. Roth, et al.
0

New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field F. The bounds apply to LRCs in which the recovery functions are linear; in particular, the bounds apply to linear LRCs over F. The new bounds are shown to improve on previously published results, especially when the repair groups are disjoint, namely, they form a partition of the set of coordinates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2018

On Optimal Locally Repairable Codes with Super-Linear Length

Locally repairable codes which are optimal with respect to the bound pre...
research
07/12/2022

Upper bounds on maximum lengths of Singleton-optimal locally repairable codes

A locally repairable code is called Singleton-optimal if it achieves the...
research
06/18/2022

New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes

We develop a new family of linear programs, that yield upper bounds on t...
research
04/18/2023

Number Theoretical Locally Recoverable Codes

In this paper we give constructions for infinite sequences of finite non...
research
10/19/2018

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes

Locally repairable codes (LRC) have gained significant interest for the ...
research
09/29/2021

Quadratic-Curve-Lifted Reed-Solomon Codes

Lifted codes are a class of evaluation codes attracting more attention d...
research
01/04/2018

Asymptotic bounds for spherical codes

The set of all error-correcting codes C over a fixed finite alphabet F o...

Please sign up or login with your details

Forgot password? Click here to reset