Optimal RS-like LRC codes of arbitrary length
RS-like locally recoverable (LRC) codes have a construction based on the classical construction of Reed-Solomon (RS) codes, where codewords are obtained as evaluations of suitably chosen polynomials. These codes were previously introduced under the assumption that the length \(n\) of the code is divisible by \(r+1,\) where \(r\) is the locality of the code. In this paper, a construction of LRC codes is proposed where the above restriction on the code length is removed completely. By this new construction, over a finite field \(\mathrm{GF}(q),\) RS-like LRC codes of any length \(n\leq q\) can be constructed. Furthermore, the length of a general LRC code can be larger than \(q.\) To cover all possible lengths of the code, the main construction has been divided into two parts: -- Construction 1 (for \(u = r - 1\) and \(r > 1\)), also covering the case \(r=2\) for which \(n\bmod (r + 1) = 1\); -- Construction 2 (for \(0 < u < r - 1\)) removes the restriction on the length of the code given in previous research, i.e., the construction covers the case \(n\bmod (r + 1) = 1\). Both constructions are based on similar idea of shortening a code of length \(\left\lceil\frac{n}{r+1}\right\rceil(r+1)\) from two local sets. Further, it is shown that these codes are distance-optimal for their parameters.
- 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
- A Family of Optimal Locally Recoverable Codes
- Bounds on the Parameters of Locally Recoverable Codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Constructions of Locally Recoverable Codes Which are Optimal
- 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?
- Locality and Availability in Distributed Storage
- Locally Repairable Codes
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- On the Locality of Codeword Symbols
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Perfect LRCs and k-optimal LRCs
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Extended integrated interleaved codes over any field with applications to locally recoverable codes
- Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
- Codes for Distributed Storage
- New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
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)
