Abstract
It was shown in \cite{GXY18} that the length of a -ary linear locally recoverable code with distance is upper bounded by . Thus, it is a challenging problem to construct -ary locally recoverable codes with distance and length approaching the upper bound. The paper \cite{GXY18} also gave an algorithmic construction of -ary locally recoverable codes with locality and length for and , where means that the implicit constant depends on locality . In the present paper, we present an explicit construction of -ary locally recoverable codes of distance and 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}.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.