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

DOI10.1109/TIT.2019.2901492MaRDI QIDQ5224101zbMATH OpenOpenAlexWikidataFDO

Authors Lingfei Jin

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.04558

zbMATH Keywords

q-ary locally recoverable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: It was shown in cite{GXY18} that the length $n$ of a $q$-ary linear locally recoverable code with distance $dge5$ is upper bounded by $O(d{q}^3)$. Thus, it is a challenging problem to construct $q$-ary locally recoverable codes with distance $dge5$ and length approaching the upper bound. The paper cite{GXY18} also gave an algorithmic construction of $q$-ary locally recoverable codes with locality $r$ and length $n=Omeg{a}_r(q^2)$ for $d=5$ and $6$, where $Omeg{a}_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 cite{GXY18}.

Recommendations

• Constructions of two classes of optimal locally repairable codes
• On binary locally repairable codes with distance four
• Constructions of optimal locally repairable codes over small fields
• Optimal RS-like LRC codes of arbitrary length
• Locality of optimal binary codes

Cited in

(29)

• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Constructions of optimal locally recoverable codes via Dickson polynomials
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• On binary locally repairable codes with distance four
• Perfect LRCs and k-optimal LRCs
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Construction of optimal locally recoverable codes and connection with hypergraph
• Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
• Codes in the sum-rank metric: fundamentals and applications
• A characterization of optimal locally repairable codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Constacyclic locally recoverable codes from their duals
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Optimal ternary locally repairable codes
• On finding the largest minimum distance of locally recoverable codes: a graph theory approach
• Optimal (2, ) locally repairable codes via punctured simplex codes
• Some new constructions of optimal and almost optimal locally repairable codes
• Weight distributions of two classes of optimal (r, )-locally repairable codes
• Quantum (r, )-locally recoverable codes
• A class of locally recoverable codes over finite chain rings
• Two families of optimal quantum locally recoverable codes
• Optimal array codes with hierarchical locality
• Tilings of \(\mathcal{H}_q(n,w)\) with optimal \((n,d,w)_q\)-codes
• Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes
• Two classes of locally recoverable codes from cyclic codes with low locality
• Optimal RS-like LRC codes of arbitrary length

This page was built for publication: Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224101)