New constructions of optimal (r, δ)-LRCs via good polynomials

被引:0
|
作者
Gao, Yuan
Yang, Siman [1 ]
机构
[1] East China Normal Univ, Sch Math Sci, Key Lab MEA, Minist Educ, Shanghai 200241, Peoples R China
关键词
Locally repairable codes; Singleton-type bound; Good polynomials; Polynomial evaluation; Distributed storage systems; LOCALLY REPAIRABLE CODES; RECOVERABLE CODES;
D O I
10.1016/j.ffa.2024.102362
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Locally repairable codes (LRCs) are a class of erasure codes that are widely used in distributed storage systems, which allow for efficient recovery of data in the case of node failures or data loss. In 2014, Tamo and Barg introduced ReedSolomon-like (RS-like) Singleton-optimal (r, delta)-LRCs based on polynomial evaluation. These constructions rely on the existence of so-called good polynomial that is constant on each of some pairwise disjoint subsets of Fq. In this paper, we extend the aforementioned constructions of RS-like LRCs and propose new constructions of (r, delta)-LRCs whose code length can be larger. These new (r, delta)-LRCs are all distance-optimal, namely, they attain an upper bound on the minimum distance that will be established in this paper. This bound is sharper than the Singleton-type bound in some cases owing to the extra conditions, it coincides with the Singleton-type bound for certain cases. Combining our constructions with known explicit good polynomials of special forms, we can get various explicit Singleton-optimal (r, delta)-LRCs with new parameters, whose code lengths are all larger than that constructed by the RS-like (r, delta)-LRCs introduced by Tamo and Barg. Note that the code length of classical RS codes and RS-like LRCs are both bounded by the field size. We explicitly construct the Singleton-optimal (r, delta)-LRCs with length n = q - 1 + delta for any positive integers r, delta >= 2 and (r + delta - 1) | (q - 1). We also show the existence of Singleton-optimal (r, delta)-LRCs with length q + delta over Fq = Fpa (a >= 3) provided p2|(r + delta - 1), (r +delta - 1)|pa-1 and p |delta. When delta is proportional to q, they are asymptotically longer than that constructed via elliptic curves whose length is at most q + 2 root q. Besides, they allow more flexibility on the values of r and delta. (c) 2024 Elsevier Inc. All rights reserved.
引用
收藏
页数:20
相关论文
共 50 条
  • [41] Some new constructions of optimal asymmetric quantum codes
    Guohui Wang
    Chunming Tang
    Weiming Wei
    Quantum Information Processing, 22
  • [42] New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
    Wei, Yongzhuang
    Pasalic, Enes
    Zhang, Fengrong
    Wu, Wenling
    Wang, Cheng-xiang
    INFORMATION SCIENCES, 2017, 415 : 377 - 396
  • [43] Optimal Cyclic Locally Repairable Codes via Cyclotomic Polynomials
    Tan, Pan
    Zhou, Zhengchun
    Yan, Haode
    Parampalli, Udaya
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (02) : 202 - 205
  • [44] Constructions of optimal binary locally repairable codes via intersection subspaces
    Zhang, Wenqin
    Tang, Deng
    Ying, Chenhao
    Luo, Yuan
    SCIENCE CHINA-INFORMATION SCIENCES, 2024, 67 (06)
  • [45] Constructions of optimal binary locally repairable codes via intersection subspaces
    Wenqin ZHANG
    Deng TANG
    Chenhao YING
    Yuan LUO
    Science China(Information Sciences), 2024, 67 (06) : 418 - 432
  • [46] Constructions of optimal variable-weight OOCs via quadratic residues
    Yan Liu
    Dianhua Wu
    Frontiers of Mathematics in China, 2013, 8 : 869 - 890
  • [47] Constructions of optimal variable-weight OOCs via quadratic residues
    Liu, Yan
    Wu, Dianhua
    FRONTIERS OF MATHEMATICS IN CHINA, 2013, 8 (04) : 869 - 890
  • [48] Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
    Luo, Gaojun
    Cao, Xiwang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6498 - 6505
  • [49] New Constructions of Binary Sequences with Good Autocorrelation Based on Interleaving Technique
    Ma, Xiuwen
    Wen, Qiaoyan
    Zhang, Jie
    Zhang, Xuan
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (12) : 2874 - 2878
  • [50] New Constructions of Asymptotically Optimal Optical Orthogonal Codes With λ=1
    Chung, Jin-Ho
    Yang, Kyeongcheol
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,