On cyclic algebraic-geometry codes

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms. We prove that cyclic algebraic geometry codes constructed in this way are closely related to cyclic extensions. We also give a detailed study of the monomial equivalence of cyclic algebraic geometry codes constructed with our method in the case of a rational function field.

Review text

The article under review combines two well-known families of error-correcting codes: algebraic-geometry (AG) codes and cyclic codes. Both families have been deeply studied and both contain codes with excellent parameters and efficient decoding algorithms. Namely, this article constructs AG codes that are cyclic. The language of function fields for AG codes is considered. A constructive algorithm, called sigma method, to construct cyclic AG codes is presented. Its main tool is the automorphism group of the function field. The sigma method can be successfully used over cyclic extensions and examples are provided over Kummer and Artin-Schreier extensions. Furthermore, a strong link between the sigma-method and the cyclic extensions is provided. Moreover, the article deals with the number of non-monomial equivalent cyclic AG codes and shows that for given length and dimension there is a unique (up to monomial equivalence) cyclic one-point AG code constructed with the sigma method.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: On cyclic algebraic-geometry codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672345)