Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

08/14/2018
by   Lingfei Jin, et al.
0

It was shown in GXY18 that the length n of a q-ary linear locally recoverable code with distance d> 5 is upper bounded by O(dq^3). Thus, it is a challenging problem to construct q-ary locally recoverable codes with distance d> 5 and length approaching the upper bound. The paper GXY18 also gave an algorithmic construction of q-ary locally recoverable codes with locality r and length n=Ω_r(q^2) for d=5 and 6, where Ω_r means that the implicit constant depends on locality r. In the present paper, we present an explicit construction of q-ary locally recoverable codes of distance d= 5 and 6 via binary constant weight codes. It turns out that (i) our construction is simpler and more explicit; and (ii) lengths of our codes are larger than those given in GXY18.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2022

Good Locally Testable Codes

An explicit construction of locally testable codes of constant rate, con...
research
06/07/2018

Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems

In this paper we propose a simple method for generating binary short-len...
research
01/21/2018

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length

An erasure code is said to be a code with sequential recovery with param...
research
11/08/2021

Locally Testable Codes with constant rate, distance, and locality

A locally testable code (LTC) is an error-correcting code that has a pro...
research
10/09/2018

Explicit optimal-length locally repairable codes of distance 5

Locally repairable codes (LRCs) have received significant recent attenti...
research
08/22/2022

Construction of binary linear constant weight codes by symmetric differences of supports

We give a construction for the binary linear constant weight codes by us...
research
11/11/2020

Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound

The Gilbert-Varshamov bound (non-constructively) establishes the existen...

Please sign up or login with your details

Forgot password? Click here to reset