A construction of optimal locally recoverable codes

被引：6
|
作者：
Li, Xiaoru [1 ]
Heng, Ziling [1 ]
机构：
[1] Changan Univ, Sch Sci, Xian 710064, Peoples R China
来源：
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2023年 / 15卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Linear code; Near MDS code; Locally recoverable code; MDS CODES; LINEAR CODES;
D O I：
10.1007/s12095-022-00619-x
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Locally recoverable codes are widely used in distributed and cloud storage systems. In this paper, we first present a construction of near MDS codes with oval polynomials and then determine the locality of the codes. It turns out that the near MDS codes and their duals are both distance-optimal and dimension-optimal locally recoverable codes. The lengths of the locally recoverable codes are different from known ones in the literature.
引用
收藏
页码：553 / 563
页数：11
相关论文
共 50 条
12345