Saved in:
Bibliographic Details
Main Authors: Huang, Junjie, Zhao, Chang-An
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.12493
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917927377174528
author Huang, Junjie
Zhao, Chang-An
author_facet Huang, Junjie
Zhao, Chang-An
contents Locally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary optimal locally repairable codes with lengths that can extend to $q+2\sqrt{q}$. In this paper, we generalize their methods to hyperelliptic curves of genus $2$, resulting in the construction of several new families of $q$-ary optimal or almost optimal locally repairable codes. Our codes feature lengths that can approach $q+4\sqrt{q}$, and the locality can reach up to $239$.
format Preprint
id arxiv_https___arxiv_org_abs_2502_12493
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Optimal and Almost Optimal Locally Repairable Codes from Hyperelliptic Curves
Huang, Junjie
Zhao, Chang-An
Information Theory
Locally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary optimal locally repairable codes with lengths that can extend to $q+2\sqrt{q}$. In this paper, we generalize their methods to hyperelliptic curves of genus $2$, resulting in the construction of several new families of $q$-ary optimal or almost optimal locally repairable codes. Our codes feature lengths that can approach $q+4\sqrt{q}$, and the locality can reach up to $239$.
title Optimal and Almost Optimal Locally Repairable Codes from Hyperelliptic Curves
topic Information Theory
url https://arxiv.org/abs/2502.12493