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

preprint2020arXivOpen access

Abstract

It was shown in \cite{GXY18} that the length nn of a qq-ary linear locally recoverable code with distance d≥5d\ge 5 is upper bounded by O(dq3)O(dq^3). Thus, it is a challenging problem to construct qq-ary locally recoverable codes with distance d≥5d\ge 5 and length approaching the upper bound. The paper \cite{GXY18} also gave an algorithmic construction of qq-ary locally recoverable codes with locality rr and length n=Ωr(q2)n=Ω_r(q^2) for d=5d=5 and 66, where ΩrΩ_r means that the implicit constant depends on locality rr. In the present paper, we present an explicit construction of qq-ary locally recoverable codes of distance d=5d= 5 and 66 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 \cite{GXY18}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.