An Improved Bound for Optimal Locally Repairable Codes

被引：0
|
作者：
Cai, Han [1 ]
Fan, Cuiling [2 ]
Miao, Ying [3 ]
Schwartz, Moshe [1 ]
Tang, Xiaohu [4 ]
机构：
[1] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel
[2] Southwest Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China
[3] Univ Tsukuba, Fac Engn Informat & Syst, Tennodai 1-1, Tsukuba, Ibaraki 3058573, Japan
[4] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China
来源：
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年
关键词：
CONSTRUCTIONS;
D O I：
10.1109/ISIT45174.2021.9518040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.
引用
收藏
页码：3379 / 3384
页数：6
相关论文
共 50 条
  • [41] New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes
    Fang, Weijun
    Lv, Jingjie
    Chen, Bin
    Xia, Shu-Tao
    Chen, Xiangyu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (03) : 1806 - 1822
  • [42] Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
    Rawat, Ankit Singh
    Koyluoglu, Onur Ozan
    Silberstein, Natalia
    Vishwanath, Sriram
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) : 212 - 236
  • [43] On the Maximal Code Length of Optimal Linear Locally Repairable Codes
    Hao, Jie
    Shum, Kenneth
    Xia, Shu-Tao
    Yang, Yi-Xian
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1326 - 1330
  • [44] Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths
    Zhao, Wei
    Shum, Kenneth W.
    Yang, Shenghao
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 7 - 12
  • [45] On Optimal Locally Repairable Codes With Super-Linear Length
    Cai, Han
    Miao, Ying
    Schwartz, Moshe
    Tang, Xiaohu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (08) : 4853 - 4868
  • [46] Optimal cyclic (r, δ) locally repairable codes with unbounded length
    Fang, Weijun
    Fu, Fang-Wei
    FINITE FIELDS AND THEIR APPLICATIONS, 2020, 63
  • [47] Optimal Cyclic (r, δ) Locally Repairable Codes with Unbounded Length
    Fang, Weijun
    Fu, Fang-Wei
    2018 IEEE INFORMATION THEORY WORKSHOP (ITW), 2018, : 265 - 269
  • [48] Optimal Cyclic Locally Repairable Codes via Cyclotomic Polynomials
    Tan, Pan
    Zhou, Zhengchun
    Yan, Haode
    Parampalli, Udaya
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (02) : 202 - 205
  • [49] Construction of Optimal Locally Repairable Codes Based on Hadamard Matrix
    Wang J.
    Tian S.
    Lei K.
    Wang X.
    Ren Y.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2022, 51 (06): : 856 - 861
  • [50] Optimal Data Placement for Stripe Merging in Locally Repairable Codes
    Wu, Si
    Du, Qingpeng
    Lee, Patrick P. C.
    Li, Yongkun
    Xu, Yinlong
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1669 - 1678
12345