On cyclic LRC codes that are also LCD codes
Charul Rajput, Maheshanand Bhaintwal, Ramakrishna Bandi
TL;DR
This paper explores the intersection of cyclic LRC codes and LCD codes, establishing conditions for their coexistence and providing bounds on their minimum distance, with practical construction examples.
Contribution
It introduces conditions for cyclic LRC codes to also be LCD codes and derives a lower bound on their minimum distance.
Findings
Established conditions for cyclic LRC codes to be LCD codes
Derived a lower bound on the minimum distance of such codes
Provided examples illustrating the construction
Abstract
Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary dual (LCD) codes are useful in fault injections attacks on storage systems. In this paper, we establish a connection between LRC codes and LCD codes. We derive some conditions on the construction of cyclic LRC codes so that they are also LCD codes. A lower bound on the minimum distance of such codes is determined. Some examples have been given to explain the construction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.