On Optimal Pseudo-cyclic (r, δ) Locally Repairable Codes

被引:0
|
作者
Chen, Bin [1 ]
Xia, Shu-Tao [1 ]
Hao, Jie [2 ]
Fu, Fang-Wei [3 ,4 ]
机构
[1] Tsinghua Univ, Grad Sch Shenzhen, Shenzhen, Peoples R China
[2] Beijing Univ Posts & Telecommun, Informat Secur Ctr, Beijing, Peoples R China
[3] Nankai Univ, Chern Inst Math, Tianjin, Peoples R China
[4] Nankai Univ, LPMC, Tianjin, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Pseudo-cyclic codes is a generalization of cyclic codes and provides a way to obtain MDS codes with more parameters in coding theory. Specially, if a is not a quadratic residue in F-q, x(n) - a only has quadratic factors over F-q for even n and k. Based on these facts, we consider the constructions of optimal q - ary pseudo-cyclic (r, delta) locally repairable codes (LRCs) with length n vertical bar q + 1 in this paper. To be specific, we obtain four classes of optimal pseudo- cyclic (r, delta)-LRCs with new parameters.
引用
收藏
页码:1191 / 1195
页数:5
相关论文
共 50 条
  • [41] Optimal Binary Locally Repairable Codes via Anticodes
    Silberstein, Natalia
    Zeh, Alexander
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1247 - 1251
  • [42] 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
  • [43] 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
  • [44] 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
  • [45] 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
  • [46] 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 - +
  • [47] Locally Repairable Convertible Codes With Optimal Access Costs
    Kong, Xiangliang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (09) : 6239 - 6257
  • [48] 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
  • [49] How Long Can Optimal Locally Repairable Codes Be?
    Guruswami, Venkatesan
    Xing, Chaoping
    Yuan, Chen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3662 - 3670
  • [50] Optimal Locally Repairable Codes Via Elliptic Curves
    Li, Xudong
    Ma, Liming
    Xing, Chaoping
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (01) : 108 - 117