Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length

DOI10.1016/j.ffa.2020.101650zbMath1446.94178arXiv1805.12345OpenAlexW3003747291MaRDI QIDQ2302600

Weijun Fang, Fang-Wei Fu

Publication date: 26 February 2020

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.12345

zbMATH Keywords

locally repairable codesdistributed storage systemsoptimal cyclic LRCssingleton-type boundgeneralized BCH bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (3)

Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Locally recoverable \(J\)-affine variety codes

Cites Work

• Cyclic and pseudo-cyclic MDS codes of length \(q + 1\)
• Optimal Locally Repairable Codes and Connections to Matroid Theory
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• Fundamentals of Error-Correcting Codes
• Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
• Optimal Locally Repairable Codes Via Elliptic Curves
• Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
• On Optimal Locally Repairable Codes With Super-Linear Length
• Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
• 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
• The structure of 1-generator quasi-twisted codes and new linear codes

This page was built for publication: Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length