Construction of optimal locally recoverable codes and connection with hypergraph

11/22/2018
by   Chaoping Xing, et al.
0

Recently, it was discovered by several authors that a q-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than q+1. This is quite different from the classical q-ary MDS codes where it is conjectured that the code length is upper bounded by q+1 (or q+2 for some special case). This discovery inspired some recent studies on length of an optimal locally recoverable code. It was shown in LXY that a q-ary optimal locally recoverable code is unbounded for d=3,4. Soon after, it was proved that a q-ary optimal locally recoverable code with distance d and locality r can have length Ω_d,r(q^1 + 1/(d-3)/2). Recently, an explicit construction of q-ary optimal locally recoverable codes for distance d=5,6 was given in J18 and BCGLP. In this paper, we further investigate construction optimal locally recoverable codes along the line of using parity-check matrices. Inspired by classical Reed-Solomon codes and J18, we equip parity-check matrices with the Vandermond structure. It is turns out that a parity-check matrix with the Vandermond structure produces an optimal locally recoverable code must obey certain disjoint property for subsets of F_q. To our surprise, this disjoint condition is equivalent to a well-studied problem in extremal graph theory. With the help of extremal graph theory, we succeed to improve all of the best known results in GXY for d≥ 7. In addition, for d=6, we are able to remove the constraint required in J18 that q is even.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2018

Optimal locally repairable codes of distance 3 and 4 via cyclic codes

Like classical block codes, a locally repairable code also obeys the Sin...
research
12/10/2021

A Class of (n, k, r, t) IS-LRCs Via Parity Check Matrix

A code is called (n, k, r, t) information symbol locally repairable code...
research
04/27/2023

Explicit Constructions of Optimal (r,δ)-Locally Repairable Codes

Locally repairable codes (LRCs) have recently been widely used in distri...
research
08/09/2022

Good locally repairable codes via propagation rules

In classical coding theory, it is common to construct new codes via prop...
research
09/25/2020

Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes

The traditional definition of Integrated Interleaved (II) codes generall...
research
12/06/2018

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures

By a locally recoverable code (LRC), we will in this paper, mean a linea...
research
05/06/2019

Lifted Multiplicity Codes

Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in...

Please sign up or login with your details

Forgot password? Click here to reset