Han Cai, Ying Miao, Moshe Schwartz, and Xiaohu Tang: A Construction of Maximally Recoverable Codes With Order-Optimal Field Size

发表刊物：IEEE Transactions on Information Theory

摘要：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 which 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.

论文类型：SCI

卷号：68

期号：8

页面范围：5060 - 5074

是否译文：否

发表时间：2022-08-15

发布期刊链接：https://ieeexplore.ieee.org/document/9739761