Cyclic Codes with Locality and Availability
Information Theory
2019-04-05 v3 math.IT
Abstract
In this work codes with availability are constructed based on the cyclic \emph{locally repairable code} (LRC) construction by Tamo et al. and their extension to -locality by Chen et al. The minimum distance of these codes is increased by carefully extending their defining set. We give a bound on the dimension of LRCs with availability and orthogonal repair sets and show that the given construction is optimal for a range of parameters.
Cite
@article{arxiv.1812.06897,
title = {Cyclic Codes with Locality and Availability},
author = {Lukas Holzbaur and Ragnar Freij-Hollanti and Antonia Wachter-Zeh},
journal= {arXiv preprint arXiv:1812.06897},
year = {2019}
}