Optimal RS-like LRC codes of arbitrary length
From MaRDI portal
Publication:780366
DOI10.1007/S00200-020-00430-2zbMATH Open1462.94070OpenAlexW3017144610MaRDI QIDQ780366FDOQ780366
Charul Rajput, Maheshanand Bhaintwal
Publication date: 15 July 2020
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00430-2
Recommendations
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- On good polynomials over finite fields for optimal locally recoverable codes
- A family of codes with variable locality and availability
- Locally recoverable \(J\)-affine variety codes
- RS-like locally recoverable codes with intersecting recovering sets
- Locally decodable codes: a brief survey
- The minimum locality of linear codes
- Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities
- Perfect LRCs and \(k\)-optimal LRCs
- Constructions of optimal locally repairable codes over small fields
Cites Work
- On the Locality of Codeword Symbols
- Locally Repairable Codes
- A Family of Optimal Locally Recoverable Codes
- Bounds on the Parameters of Locally Recoverable Codes
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Constructions of Locally Recoverable Codes Which are Optimal
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Locality and Availability in Distributed Storage
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- How Long Can Optimal Locally Repairable Codes Be?
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
Cited In (3)
This page was built for publication: Optimal RS-like LRC codes of arbitrary length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780366)
