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.acceptedVersio
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers i...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...
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 construct certain error-correcting codes over finite rings and estimate their parameters. These c...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
A part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to th...
AbstractWe construct codes generated via the recent theory of V.D. Goppa, using elliptic curves over...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
AbstractWe propose a uniform approach to BCH codes, Goppa codes, and subfield subcodes of algebraic ...
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers i...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...
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 construct certain error-correcting codes over finite rings and estimate their parameters. These c...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractParameters and generator matrices are given for the codes obtained by applying Goppa's algeb...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
A part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to th...
AbstractWe construct codes generated via the recent theory of V.D. Goppa, using elliptic curves over...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
AbstractWe propose a uniform approach to BCH codes, Goppa codes, and subfield subcodes of algebraic ...
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers i...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C)...