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

by   Han Cai, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


Skew Constacyclic and LCD Codes over F_q+v F_q

The aim of this paper is to give conditions for the equivalency between ...

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

We construct maximally recoverable codes (corresponding to partial MDS c...

On cyclic LRC codes that are also LCD codes

Locally recoverable (LRC) codes provide a solution to single node failur...

New Binary Quantum Codes Constructed from Quasi-Cyclic Codes

It is well known that quantum codes can be constructed by means of class...

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

Our goal is to provide a sufficient schedulability test -ideally polynom...

Maximally recoverable local reconstruction codes from subspace direct sum systems

Maximally recoverable local reconstruction codes (MR LRCs for short) hav...

Constructions of maximally recoverable local reconstruction codes via function fields

Local Reconstruction Codes (LRCs) allow for recovery from a small number...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.