A Construction of Optimal (r, δ)-Locally Recoverable Codes

被引：7
|
作者：
Chen, Bocong [1 ]
Huang, Jing [1 ]
机构：
[1] South China Univ Technol, Sch Math, Guangzhou 510641, Guangdong, Peoples R China
来源：
IEEE ACCESS | 2019年 / 7卷
基金：
中国博士后科学基金; 中国国家自然科学基金;
关键词：
Distributed storage systems; locally recoverable codes; singleton-type bound; LOCALLY REPAIRABLE CODES;
D O I：
10.1109/ACCESS.2019.2957942
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Locally recoverable codes (LRCs) play a significant role in distributed and cloud storage systems. The key ingredient for constructing such optimal LRCs is to characterize the parity-check matrix for LRCs. In this letter based on the parity-check matrix for generalized Reed-Solomon codes we mainly present new constructions of optimal (r, delta)-locally recoverable codes with unbounded lengths in terms of the properties of the Vandermonde matrices, of which the parameters contain the known ones.
引用
收藏
页码：180349 / 180353
页数：5
相关论文
共 50 条
12345