Han Cai, Ying Miao, Moshe Schwartz, and Xiaohu Tang: On optimal locally repairable codes with super-linear length

发表刊物：IEEE Transactions on Information Theory

摘要：In this paper, locally repairable codes which have optimal minimum Hamming distance 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 apply to more general cases, and have weaker requirements compared with the known ones. In this sense, they both improve and generalize previously known bounds. Further, optimal codes are constructed, whose length is order-optimal with respect to the new upper bounds. Notably, the length of the codes is super-linear in the alphabet size.

论文类型：SCI

卷号：66

期号：8

页面范围：4853 - 4868

是否译文：否

发表时间：2020-08-15

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