IEICE TRANSACTIONS on Fundamentals
On Locality of Some Binary LCD Codes
Summary :
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 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E106-A No.10 pp.1330-1335
- Publication Date
- 2023/10/01
- Publicized
- 2023/04/05
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2023EAP1003
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Ruipan YANG
Air Force Engineering University
Ruihu LI
Air Force Engineering University
Qiang FU
Air Force Engineering University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ruipan YANG, Ruihu LI, Qiang FU, "On Locality of Some Binary LCD Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 10, pp. 1330-1335, October 2023, doi: 10.1587/transfun.2023EAP1003.
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 n≥k+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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023EAP1003/_p
Copy
@ARTICLE{e106-a_10_1330,
author={Ruipan YANG, Ruihu LI, Qiang FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Locality of Some Binary LCD Codes},
year={2023},
volume={E106-A},
number={10},
pages={1330-1335},
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 n≥k+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.},
keywords={},
doi={10.1587/transfun.2023EAP1003},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - On Locality of Some Binary LCD Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1330
EP - 1335
AU - Ruipan YANG
AU - Ruihu LI
AU - Qiang FU
PY - 2023
DO - 10.1587/transfun.2023EAP1003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2023
AB - 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 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.
ER -
English
