Optimal RS-like LRC codes of arbitrary length

DOI10.1007/s00200-020-00430-2zbMath1462.94070OpenAlexW3017144610MaRDI QIDQ780366

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)

Related Items (2)

New constructions of optimal \((r, \delta)\)-LRCs via good polynomials ⋮ Codes for Distributed Storage

Cites Work

• Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
• Optimal Locally Repairable Codes and Connections to Matroid Theory
• Locality and Availability in Distributed Storage
• Bounds on the Parameters of Locally Recoverable Codes
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• Constructions of Locally Recoverable Codes Which are Optimal
• 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

This page was built for publication: Optimal RS-like LRC codes of arbitrary length