Optimal RS-like LRC codes of arbitrary length

DOI10.1007/S00200-020-00430-2zbMATH Open1462.94070OpenAlexW3017144610MaRDI QIDQ780366FDOQ780366

Authors 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

zbMATH Keywords

shortened codesLRC codesoptimal LRC codesRS-like LRC codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

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

• 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

Cited in

(7)

• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Extended integrated interleaved codes over any field with applications to locally recoverable codes
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• Codes for Distributed Storage
• Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
• Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
• Perfect LRCs and \(k\)-optimal LRCs

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)