Abstract
Locally recoverable (LRC) codes and linear complementary dual (LCD) codes are both useful in distributed storage systems. In this letter, we establish a connection between LRC codes and LCD codes. We derive some conditions on the construction of cyclic codes with $(r,\delta)$ locality and codes with hierarchical locality so that they are also LCD codes. Some constructed codes are optimal. These codes may be useful in simultaneously providing local recoverability and security against certain attacks in distributed storage systems.
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
