A construction of optimal locally recoverable codes

04/26/2022
by   Xiaoru Li, et al.
0

Locally recoverable codes are widely used in distributed and cloud storage systems. The objective of this paper is to present a construction of near MDS codes with oval polynomials and then determine the locality of the codes. It turns out that the near MDS codes and their duals are both distance-optimal and dimension-optimal locally recoverable codes. The lengths of the locally recoverable codes are different from known ones in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2022

Near-MDS Codes from Maximal Arcs in PG(2,q)

The singleton defect of an [n,k,d] linear code C is defined as s( C)=n-k...
research
02/01/2021

The minimum linear locality of linear codes

Locally recoverable codes (LRCs) were proposed for the recovery of data ...
research
09/28/2021

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes

Locally repairable codes have become a key instrument in large-scale dis...
research
08/05/2019

Constructive asymptotic bounds of locally repairable codes via function fields

Locally repairable codes have been investigated extensively in recent ye...
research
02/02/2018

On taking advantage of multiple requests in error correcting codes

In most notions of locality in error correcting codes -- notably locally...
research
06/29/2018

Constructions of Locally Recoverable Codes which are Optimal

We provide a Galois theoretical framework which allows to produce good p...
research
06/04/2020

Access-optimal Linear MDS Convertible Codes for All Parameters

In large-scale distributed storage systems, erasure codes are used to ac...

Please sign up or login with your details

Forgot password? Click here to reset