Explicit optimal-length locally repairable codes of distance 5

by   Allison Beemer, et al.

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.


page 1

page 2

page 3

page 4


Codes with Combined Locality and Regeneration Having Optimal Rate, d_min and Linear Field Size

In this paper, we study vector codes with all-symbol locality, where the...

Explicit Constructions of Optimal (r,δ)-Locally Repairable Codes

Locally repairable codes (LRCs) have recently been widely used in distri...

Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

It was shown in GXY18 that the length n of a q-ary linear locally recove...

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...

On Locally Decodable Codes in Resource Bounded Channels

Constructions of locally decodable codes (LDCs) have one of two undesira...

Use of Set Shaping theory in the development of locally testable codes

In developing locally testable codes, information is added to the coded ...

On the Size of Levenshtein Balls

The rapid development of DNA storage has brought the deletion and insert...

Please sign up or login with your details

Forgot password? Click here to reset