


























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 $(r,ρ)$-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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。