We look at AG codes associated to P 1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of generalized Reed-Solomon codes with large automorphism groups G, such as G = P SL(2, q), and explicitly describe their G-module structure.
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
AbstractWe determine the n-automorphism group of generalized algebraic-geometry codes associated wit...
We survey some encoding methods for AG codes, focusing primarily on one approach utilizing code auto...
Codes are used to store and send information. In this thesis we discuss binary codes, which can be s...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
We show that in many cases, the automorphism group of a curve and the permutation automorphism grou...
Nous demontrons que le groupe d'automorphismes des codes de Reed-Muller p-aires est le groupe genera...
AbstractA class of maximum distance separable codes is introduced which includes Reed Solomon codes;...
This paper deals with the problem of determining whether a PD-set exists for a given linear code C a...
AbstractA group code structure of a linear code is a description of the code as one-sided or two-sid...
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes o...
The purpose of this work with its results presented in the article was to develop and transfer to th...
In this paper we investigate multi-point Algebraic–Geometric codes associated to the GK maximal curv...
Algebraic structure of codes over F<sub>q</sub>, closed under arbitrary abelian group G of permutati...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
AbstractWe determine the n-automorphism group of generalized algebraic-geometry codes associated wit...
We survey some encoding methods for AG codes, focusing primarily on one approach utilizing code auto...
Codes are used to store and send information. In this thesis we discuss binary codes, which can be s...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
We show that in many cases, the automorphism group of a curve and the permutation automorphism grou...
Nous demontrons que le groupe d'automorphismes des codes de Reed-Muller p-aires est le groupe genera...
AbstractA class of maximum distance separable codes is introduced which includes Reed Solomon codes;...
This paper deals with the problem of determining whether a PD-set exists for a given linear code C a...
AbstractA group code structure of a linear code is a description of the code as one-sided or two-sid...
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes o...
The purpose of this work with its results presented in the article was to develop and transfer to th...
In this paper we investigate multi-point Algebraic–Geometric codes associated to the GK maximal curv...
Algebraic structure of codes over F<sub>q</sub>, closed under arbitrary abelian group G of permutati...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
AbstractWe determine the n-automorphism group of generalized algebraic-geometry codes associated wit...