On Optimal Locally Repairable Codes with Super-Linear Length

被引：0
|
作者：
Cai, Han [1 ]
Miao, Ying [2 ]
Schwartz, Moshe [1 ]
Tang, Xiaohu [3 ]
机构：
[1] Ben Gurion Univ Negev, Elect & Comp Engn, Beer Sheva, Israel
[2] Univ Tsukuba, Engn Informat & Syst, Tsukuba, Ibaraki, Japan
[3] Southwest Jiaotong Univ, Informat Sci & Technol, Chengdu, Sichuan, Peoples R China
来源：
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1109/isit.2019.8849226
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Optimal locally repairable codes 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 both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order optimal when compared with the new upper bounds. The length of the codes is super linear in the alphabet size.
引用
收藏
页码：2818 / 2822
页数：5
相关论文
共 50 条
  • [31] Optimal Binary Locally Repairable Codes via Anticodes
    Silberstein, Natalia
    Zeh, Alexander
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1247 - 1251
  • [32] Constructions and Weight Distributions of Optimal Locally Repairable Codes
    Hao, Jie
    Zhang, Jun
    Xia, Shu-Tao
    Fu, Fang-Wei
    Yang, Yixian
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (05) : 2895 - 2908
  • [33] On Lengths of Singleton-Optimal Locally Repairable Codes
    Liu, Shu
    Wu, Ting-Yi
    Xing, Chaoping
    Yuan, Chen
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (01) : 3 - 12
  • [34] Optimal Locally Repairable Systematic Codes Based on Packings
    Cai, Han
    Cheng, Minquan
    Fan, Cuiling
    Tang, Xiaohu
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (01) : 39 - 49
  • [35] Optimal Locally Repairable Codes and Connections to Matroid Theory
    Tamo, Itzhak
    Papailiopoulos, Dimitris S.
    Dimakis, Alexandros G.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (12) : 6661 - 6671
  • [36] Optimal Locally Repairable Codes and Connections to Matroid Theory
    Tamo, Itzhak
    Papailiopoulos, Dimitris S.
    Dimakis, Alexandros G.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1814 - +
  • [37] Locally Repairable Convertible Codes With Optimal Access Costs
    Kong, Xiangliang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (09) : 6239 - 6257
  • [38] Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes
    Chen, Bin
    Xia, Shu-Tao
    Hao, Jie
    Fu, Fang-Wei
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 2499 - 2511
  • [39] Optimal Locally Repairable Codes: An Improved Bound and Constructions
    Cai, Han
    Fan, Cuiling
    Miao, Ying
    Schwartz, Moshe
    Tang, Xiaohu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5060 - 5074
  • [40] How Long Can Optimal Locally Repairable Codes Be?
    Guruswami, Venkatesan
    Xing, Chaoping
    Yuan, Chen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3662 - 3670
12345