On cyclic LRC codes that are also LCD codes

2023

Preprint

Efficient distributed storage systems are favorable for handling big data, and it is deployed across network of plenty of different storage nodes. In order to improving reliability and efficiency, locally repairable codes (LRCs) are especially beneficial. On the other hand, linear complementary dual (LCD) codes are proved useful for preventing malicious attacks, which helps to secure the system. For the purpose of enhancing repair effciency and security, we put LRC and LCD code together for consideration in this paper. A new construction of ternary LRCs that are also LCD codes is given. Many ternary LCD-LRCs are obtained, whose parameters are optimal in terms of the bound of LRC.

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

New construction of ternary locally repairable codes that are also LCD codes

2023

Preprint

Section: Introductionmentioning

confidence: 99%

New construction of ternary locally repairable codes that are also LCD codes

2023

Preprint

The concept of locally repairable code(LRC) is presented to improve the reliability and efficiency of distributed storage systems. linear complementary dual (LCD) code is proved useful for preventing malicious attacks, and helps to secure the system. In this paper, we put LRC and LCD code together for consideration, to enhance repair efficiency and security. Firstly, a new method of constructing self-orthogonal code from arbitrary ternary linear code is proved. Then a new construction of ternary LRC that is also LCD code with small locality is proposed. As a result, plenty of ternary LCD-LRCs attaining the CM bound are obtained, which shows the effectiveness of our method.

“…A few years ago, LCD codes were proved helpful for securing communication against sidechannel attacks (SCA) and fault injection attack (FIA) [9]. Locally repairable codes that are also LCD codes, especially distance-optimal LCD codes, may provide fast recovery during node failures and protection against malicious attacks on distributed storage systems [10]. Rajput et al construct several types of cyclic LRC-LCD codes, and determine an upper bound on the minimum distance of this code [10].…”

Section: Introductionmentioning

confidence: 99%

On Locality of Some Binary LCD Codes

IEICE Trans. Fundamentals

2023

The design of codes for distributed storage systems that protects from node failures has been studied for years, and locally repairable code (LRC) is such a method that gives a solution for fast recovery of node failures. Linear complementary dual code (LCD code) is useful for preventing malicious attacks, which helps to secure the system. In this paper, we combine LRC and LCD code by integration of enhancing security and repair efficiency, and propose some techniques for constructing LCD codes with their localities determined. On the basis of these methods and inheriting previous achievements of optimal LCD codes, we give optimal or near-optimal [n, k, d; r] LCD codes for k ≤ 6 and n ≥ k+1 with relatively small locality, mostly r ≤ 3. Since all of our obtained codes are distanceoptimal, in addition, we show that the majority of them are r-optimal and the other 63 codes are all near r-optimal, according to CM bound.