Optimal binary linear locally repairable codes with disjoint repair groups
From MaRDI portal
(Redirected from Publication:5206236)
Abstract: In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary LRCs are of interest in practice. In this paper, we focus on binary linear LRCs with disjoint repair groups. We first derive an explicit bound for the dimension k of such codes, which can be served as a generalization of the bounds given in [11, 36, 37]. We also give several new constructions of binary LRCs with minimum distance based on weakly independent sets and partial spreads, which are optimal with respect to our newly obtained bound. In particular, for locality and minimum distance , we obtain the desired optimal binary linear LRCs with disjoint repair groups for almost all parameters.
Recommendations
Cites work
- A Family of Optimal Locally Recoverable Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- Binary Linear Locally Repairable Codes
- Bounds on the size of locally recoverable codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Error-Correcting Codes in Projective Space
- Explicit Maximally Recoverable Codes With Locality
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Improved upper bounds for partial spreads
- Locality of optimal binary codes
- Locally recoverable codes on algebraic curves
- On sequential locally repairable codes
- On the Locality of Codeword Symbols
- On the locality of codeword symbols in non-linear codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Partial spreads in finite projective spaces and partial designs
- Partitions of finite vector spaces over \(\mathrm{GF}(2)\) into subspaces of dimensions 2 and \(s\)
- Repair Locality With Multiple Erasure Tolerance
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- The maximum size of a partial spread in \(H(5,q^{2})\) is \(q^{3}+1\)
Cited in
(15)- On binary matroid minors and applications to data storage over small fields
- Infinite families of optimal linear codes and their applications to distributed storage systems
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- On binary locally repairable codes with distance four
- On Optimal Locally Repairable Codes With Super-Linear Length
- Codes for Distributed Storage
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
- Optimal binary and ternary locally repairable codes with minimum distance 6
- On locality of binary distance-optimal codes
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- Easy repair via codes with simplex locality
- Bounds on the size of (r,)-locally repairable codes for fixed values q and d
- Hull dimension of optimal binary LRCs with availability
This page was built for publication: Optimal binary linear locally repairable codes with disjoint repair groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206236)
