On Optimal Locally Repairable Codes with Super-Linear Length
arXiv:1812.11942
Abstract
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.
References in corpus (7)
- A family of optimal locally recoverable codes
- Repair Locality with Multiple Erasure Tolerance
- The existence of designs
- Locally Repairable Codes with Multiple Repair Alternatives
- Explicit optimal-length locally repairable codes of distance 5
- Optimal LRC codes for all lenghts n <= q
- Irregular Recovery and Unequal Locality for Locally Recoverable Codes with Availability