*Partially supported by NATO.We study Ca,b curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how Ca;b curves can be used to construct MDS codes and focus on some Ca;b curves with extra automorphisms, namely y^3 = x^4 + 1, y^3 = x^4 - x, y^3 - y = x^4. The automorphism groups of such codes are determined in most characteristics
When information is transmitted, errors are likely to occur. Coding theory examines efficient ways o...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to constr...
Channel coding is the branch of Information Theory which studies the noise that can occur in data tr...
In this paper we investigate multi-point Algebraic–Geometric codes associated to the GK maximal curv...
We introduce two types of curves of interest for coding theory purposes: the so-called Castle and we...
We consider a class of codes defined by Goppa’s algebraic-geometric construction on Fermat curves. A...
AbstractWe consider a class of generalized algebraic-geometry codes based on places of the same degr...
We show that in many cases, the automorphism group of a curve and the permutation automorphism grou...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
AbstractWe determine the n-automorphism group of generalized algebraic-geometry codes associated wit...
Let be a plane curve defined over the algebraic closure K of a finite prime field p by a separated p...
Ideas from algebraic geometry became useful in coding theory after Goppa’s construction [8]. He had ...
In 1981 V.D. Goppa [9] used the evaluation of rational functions on algebraic curves to define a ne...
In this master thesis we introduce algebraic geometry codes (AG codes). Be- sides basic definitions,...
When information is transmitted, errors are likely to occur. Coding theory examines efficient ways o...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to constr...
Channel coding is the branch of Information Theory which studies the noise that can occur in data tr...
In this paper we investigate multi-point Algebraic–Geometric codes associated to the GK maximal curv...
We introduce two types of curves of interest for coding theory purposes: the so-called Castle and we...
We consider a class of codes defined by Goppa’s algebraic-geometric construction on Fermat curves. A...
AbstractWe consider a class of generalized algebraic-geometry codes based on places of the same degr...
We show that in many cases, the automorphism group of a curve and the permutation automorphism grou...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
AbstractWe determine the n-automorphism group of generalized algebraic-geometry codes associated wit...
Let be a plane curve defined over the algebraic closure K of a finite prime field p by a separated p...
Ideas from algebraic geometry became useful in coding theory after Goppa’s construction [8]. He had ...
In 1981 V.D. Goppa [9] used the evaluation of rational functions on algebraic curves to define a ne...
In this master thesis we introduce algebraic geometry codes (AG codes). Be- sides basic definitions,...
When information is transmitted, errors are likely to occur. Coding theory examines efficient ways o...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to constr...