English

Dual and Covering Radii of Extended Algebraic Geometry Codes

Information Theory 2025-09-29 v1 math.IT

Abstract

Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus g1g\ge1. In this paper, we investigate extended AG codes and Roth-Lempel type AG codes, including their dual codes and minimum distances. Moreover, we show that for certain gg, the length of a gg-MDS code over a finite field Fq\mathbb{F}_q can attain q+1+2gqq+1+2g\sqrt{q}, which is achieved by an extended AG code from the maximal curves of genus gg. Notably, for some small finite fields, this length q+1+2gqq+1+2g\sqrt{q} is the largest among all known gg-MDS codes. Subsequently, we establish that the covering radius of an [n,k][n,k] extended AG code has g+2g+2 possible values. For the case of g=1g=1, we prove that this range reduces to two possible values when the length nn is sufficiently large, or when there exists an [n,k+1][n,k+1] MDS elliptic code.

Keywords

Cite

@article{arxiv.2509.21773,
  title  = {Dual and Covering Radii of Extended Algebraic Geometry Codes},
  author = {Yunlong Zhu and Chang-An Zhao},
  journal= {arXiv preprint arXiv:2509.21773},
  year   = {2025}
}

Comments

28