Optimal LRC codes for all lenghts n <= q

Abstract

A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.

Cited by in corpus (4)

• Erasure Coding for Distributed Storage: An Overview
• Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
• On Optimal Locally Repairable Codes with Super-Linear Length
• Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions