New lower bounds for the minimum distance of generalized algebraic geometry codes (Q2376565)

Generalized algebraic geometry (GAG) codes were proposed by \textit{C. Xing, H. Niederreiter} and \textit{K. Y. Lam} [IEEE Trans. Inform. Theory 45, No 7, 2438--2501 (1999; Zbl 0956.94023)]. While usual algebraic geometry (AG) codes uses only rational points of a curve defined over a finite field, GAG codes consider points (or places) of any degree. The minimum distance of both types of codes can not be estimated a priori and only some bounds are known. Section 2 of this paper gives some improvements to known lower bounds for GAG codes. These bounds allow to provide some examples of new codes with good parameters. Section 3 is devoted to the study of a particular kind of GAG codes, which are constructed using points of the curve all of the same degree \(n\). These codes can be embedded into an AG codes and its so called \(n\)-automorphism group identified with a subgroup of the automorphism group of that AG code. Finally the paper shows that an algorithm for AG codes due to \textit{A. M. Shokrollahi} and \textit{H. Wasserman} [Proceeding of the Thirtieth Annual ACM Symposium Theory of Computing, Dallas, USA, 241--248 (1998; Zbl 1027.68605)] can be adapted to the decoding of the GAG codes described in Section 3.