We construct linear codes from scrolls over curves of high genus and study the higher support weights di of these codes. We embed the scroll into projective space Pk-1 and calculate bounds for the di by considering the maximal number of Fq-rational points that are contained in a codimension h subspace of Pk-1. We nd lower bounds of the di and for the cases of large i calculate the exact values of the di. This work follows the natural generalisation of Goppa codes to higher-dimensional varieties as studied by S.H. Hansen, C. Lomont and T. Nakashima
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Sin...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
A method of constructing long geometric Goppa codes coming from fiber products of superelliptic curv...
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
Abstract. The in general hard problem of computing weight distributions of linear codes is considere...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
ABSTRACT. The discovery of algebraic geometric codes constructed on curves led to generalising this ...
AbstractWords of low weight in trace codes correspond to curves with many points and the same holds ...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Sin...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
A method of constructing long geometric Goppa codes coming from fiber products of superelliptic curv...
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
Abstract. The in general hard problem of computing weight distributions of linear codes is considere...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
ABSTRACT. The discovery of algebraic geometric codes constructed on curves led to generalising this ...
AbstractWords of low weight in trace codes correspond to curves with many points and the same holds ...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Sin...