Extension of Optimal Locally Repairable codes
Yunlong Zhu, Chang-An Zhao

TL;DR
This paper introduces new constructions of optimal locally repairable codes (LRCs) using function fields, extending code lengths and providing novel methods for code extension while maintaining optimality.
Contribution
The paper presents several new constructions of optimal LRCs by extending existing codes and exploring elliptic and rational function fields, achieving longer code lengths and new optimal parameters.
Findings
Code length extended to q+2 over finite fields.
New construction of optimal (r,3)-LRCs by extending code blocks.
Optimal LRCs derived from elliptic function fields with lengths up to q+2√q-2r-2.
Abstract
Recent studies have delved into the construction of locally repairable codes (LRCs) with optimal minimum distance from function fields. In this paper, we present several novel constructions by extending the findings of optimally designed locally repairable codes documented in the literature. Let denote an optimal LRC of locality , implying that every repairable block of is a MDS code, and maximizes its minimum distance. By extending a single coordinate of one of these blocks, we demonstrate that the resulting code remains an optimally designed locally repairable code. This suggests that the maximal length of an optimal LRC from rational function fields can be extended up to over a finite field . In addition, we give a new construction of optimal -LRC by extending one coordinate in each block within . Furthermore, we propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · Coding theory and cryptography
