Singleton-Type Optimal LRCs with Minimum Distance 3 and 4 from Projective Code

被引：5

作者：

Fu, Qiang ^{[1
]}

Li, Ruihu ^{[1
]}

Guo, Luobin ^{[1
]}

Chen, Gang

机构：

[1] Air Force Engn Univ, Basic Sci, Xian, Peoples R China

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2021年 / E104A卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Singleton-type bound; optimal locally repairable codes; projective cap; LOCALLY REPAIRABLE CODES; BINARY;

D O I：

10.1587/transfun.2019EAL2158

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Locally repairable codes (LRCs) are implemented in distributed storage systems (DSSs) due to their low repair overhead. The locality of an LRC is the number of nodes in DSSs that participate in the repair of failed nodes, which characterizes the repair cost. An LRC is called optimal if its minimum distance attains the Singleton-type upper bound [1]. In this letter, optimal LRCs are considered. Using the concept of projective code in projective space PG(k, q) and shortening strategy, LRCs with d=3 are proposed. Meantime, derived from an ovoid [q(2) + 1, 4, q(2)](q) code (responding to a maximal (q(2) + 1)-cap in PG(3, q)), optimal LRCs over F-q with d = 4 are constructed.

引用

页码：319 / 323

页数：5