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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
