Optimal Locally Repairable Codes: An Improved Bound and Constructions

From MaRDI portal
Publication:5096971

DOI10.1109/TIT.2022.3161613zbMATH Open1505.94089arXiv2011.04966OpenAlexW3104144315MaRDI QIDQ5096971FDOQ5096971


Authors: Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang, Cui Ling Fan Edit this on Wikidata


Publication date: 19 August 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. We then also provide explicit constructions of optimal codes that show that for certain parameters the new bound is sharp. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.


Full work available at URL: https://arxiv.org/abs/2011.04966








Cited In (11)





This page was built for publication: Optimal Locally Repairable Codes: An Improved Bound and Constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096971)