Dual and Covering Radii of Extended Algebraic Geometry Codes

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 g1. 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 g, the length of a g-MDS code over a finite field Fq can attain q+1+2gq, which is achieved by an extended AG code from the maximal curves of genus g. Notably, for some small finite fields, this length q+1+2gq is the largest among all known g-MDS codes. Subsequently, we establish that the covering radius of an [n,k] extended AG code has g+2 possible values. For the case of g=1, we prove that this range reduces to two possible values when the length n is sufficiently large, or when there exists an [n,k+1] MDS elliptic code.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…