A construction of optimal locally recoverable codes

Locally recoverable codes are widely used in distributed and cloud storage systems. In this paper, we first 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...

Full description

Saved in:
Bibliographic Details
Published in:Cryptography and communications 2023-05, Vol.15 (3), p.553-563
Main Authors: Li, Xiaoru, Heng, Ziling
Format: Article
Language:English
Subjects:
Circuits
Cloud computing
Coding and Information Theory
Communications Engineering
Computer Science
Data Structures and Information Theory
Information and Communication
Mathematics of Computing
Networks
Polynomials
Storage systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Locally recoverable codes are widely used in distributed and cloud storage systems. In this paper, we first 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.
ISSN:1936-2447
1936-2455
DOI:10.1007/s12095-022-00619-x