A construction of optimal locally recoverable codes
Xiaoru Li, Ziling Heng
TL;DR
This paper presents a new construction of near MDS locally recoverable codes using oval polynomials, achieving optimality in distance and dimension, with lengths differing from existing codes.
Contribution
It introduces a novel construction method for near MDS locally recoverable codes based on oval polynomials, expanding the known code lengths.
Findings
Codes are both distance-optimal and dimension-optimal
Codes and their duals have optimal locality
Lengths of codes differ from known constructions
Abstract
Locally recoverable codes are widely used in distributed and cloud storage systems. The objective of this paper is to present a construction of near MDS codes with oval polynomials and then determine the locality of the codes. It turns out that the near MDS codes and their duals are both distance-optimal and dimension-optimal locally recoverable codes. The lengths of the locally recoverable codes are different from known ones in the literature.
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 · Cryptography and Data Security · Caching and Content Delivery