AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersection or a vector bundle on a projective variety) we prove the existence of an extension Fqe (no explicit lower bound for e) such that the associated code over Fqe has a strong uniformity property (all submatrices of a certain type have the same rank)
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractLet C be a smooth, geometrically connected, projective curve of genus g⩾2 defined over Fq. H...
AbstractWe give a construction of error-correcting codes from Grassmann bundles associated to a vect...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
AbstractWe investigate the parameters of the algebraic–geometric codes constructed from vector bundl...
AbstractWe show how to construct error-correcting codes from flag varieties on a finite field Fq. We...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
AbstractWe generalize a recent idea for constructing codes over a finite field Fq by evaluating a ce...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractLet C be a smooth, geometrically connected, projective curve of genus g⩾2 defined over Fq. H...
AbstractWe give a construction of error-correcting codes from Grassmann bundles associated to a vect...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
AbstractWe investigate the parameters of the algebraic–geometric codes constructed from vector bundl...
AbstractWe show how to construct error-correcting codes from flag varieties on a finite field Fq. We...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
AbstractWe generalize a recent idea for constructing codes over a finite field Fq by evaluating a ce...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...