On Optimal Locally Repairable Codes with Super-Linear Length
Information Theory
2019-04-10 v4 math.IT
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.
Cite
@article{arxiv.1812.11942,
title = {On Optimal Locally Repairable Codes with Super-Linear Length},
author = {Han Cai and Ying Miao and Moshe Schwartz and Xiaohu Tang},
journal= {arXiv preprint arXiv:1812.11942},
year = {2019}
}