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

01/02/2022
by   Han Cai, et al.
0

We prove a new lower bound on the field size of locally repairable codes (LRCs). Additionally, we construct maximally recoverable (MR) codes which are cyclic. While a known construction for MR codes has the same parameters, it produces non-cyclic codes. Furthermore, we prove necessary and sufficient conditions that specify when the known non-cyclic MR codes may be permuted to become cyclic, thus proving our construction produces cyclic MR codes with new parameters. Furthermore, using our new bound on the field size, we show that the new cyclic MR codes have optimal field size in certain cases. Other known LRCs are also shown to have optimal field size in certain cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2019

Skew Constacyclic and LCD Codes over F_q+v F_q

The aim of this paper is to give conditions for the equivalency between ...
research
11/27/2020

A Construction of Maximally Recoverable Codes with Order-Optimal Field Size

We construct maximally recoverable codes (corresponding to partial MDS c...
research
08/30/2022

On the exponent of cyclic codes

We propose an algorithm to find a lower bound for the number of cyclic c...
research
11/05/2020

On cyclic LRC codes that are also LCD codes

Locally recoverable (LRC) codes provide a solution to single node failur...
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
10/26/2011

Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model

Our goal is to provide a sufficient schedulability test -ideally polynom...
research
03/22/2019

Cliques in projective space and construction of Cyclic Grassmannian Codes

The construction of Grassmannian codes in some projective space is of hi...

Please sign up or login with your details

Forgot password? Click here to reset