On cyclic LRC codes that are also LCD codes

11/05/2020
by   Charul Rajput, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2019

Optimal p-ary cyclic codes with two zeros

As a subclass of linear codes, cyclic codes have efficient encoding and ...
research
07/27/2021

On the data persistency of replicated erasure codes in distributed storage systems

This paper studies the fundamental problem of data persistency for a gen...
research
11/28/2022

Three classes of BCH codes and their duals

BCH codes are an important class of cyclic codes, and have wide applican...
research
03/13/2023

Four infinite families of ternary cyclic codes with a square-root-like lower bound

Cyclic codes are an interesting type of linear codes and have wide appli...
research
01/02/2022

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It

We prove a new lower bound on the field size of locally repairable codes...
research
10/03/2020

Codes for Distributed Storage

This chapter deals with the topic of designing reliable and efficient co...
research
10/18/2018

Abelian Noncyclic Orbit Codes and Multishot Subspace Codes

In this paper we characterize the orbit codes as geometrically uniform c...

Please sign up or login with your details

Forgot password? Click here to reset