IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508

This article has now been updated. Please use the final version.

On locality of some binary LCD codes
Ruipan YANGRuihu LIQiang FU
Author information
JOURNAL FREE ACCESS Advance online publication

Article ID: 2023EAP1003

Details
Abstract

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 nk+1 with relatively small locality, mostly r ≤ 3. Since all of our obtained codes are distance-optimal, 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.

Content from these authors
© 2023 The Institute of Electronics, Information and Communication Engineers
feedback
Top