A characterization of optimal locally repairable codes
From MaRDI portal
Publication:6041876
Recommendations
- Constructions of two classes of optimal locally repairable codes
- Perfect LRCs and \(k\)-optimal LRCs
- Locality of optimal binary codes
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Constructions of optimal locally repairable codes over small fields
Cites work
- A Family of Optimal Locally Recoverable Codes
- Anticode-based locally repairable codes with high availability
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Bounds on the Parameters of Locally Recoverable Codes
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Constructions of Locally Recoverable Codes Which are Optimal
- Constructions of optimal locally repairable codes over small fields
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
- How Long Can Optimal Locally Repairable Codes Be?
- Locally recoverable codes on algebraic curves
- Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- On binary locally repairable codes with distance four
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On the Locality of Codeword Symbols
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
Cited in
(25)- Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
- Optimal ternary locally repairable codes
- Optimal binary linear locally repairable codes with disjoint repair groups
- A function field approach toward good polynomials for further results on optimal LRC codes
- Optimal cyclic locally repairable codes with unbounded length from their zeros
- On Optimal Locally Repairable Codes With Super-Linear Length
- Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes
- A Family of Optimal Locally Recoverable Codes
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
- Some new constructions of optimal and almost optimal locally repairable codes
- Anticode-based locally repairable codes with high availability
- The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
- Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
- Computing sharp recovery structures for locally recoverable codes
- Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
- Constructions of two classes of optimal locally repairable codes
- scientific article; zbMATH DE number 7378653 (Why is no real title available?)
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- Liar's dominating set in unit disk graphs
- Constructions of optimal locally repairable codes over small fields
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- On Singleton-type bound of locally repairable codes
- On locality of binary distance-optimal codes
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- Locality of optimal binary codes
This page was built for publication: A characterization of optimal locally repairable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041876)
