AbstractWe give a construction of error-correcting codes from Grassmann bundles associated to a vector bundle on a curve defined over a finite field Fq. We also consider codes from fibered varieties whose fibers are quadric or Hermitian varieties
AbstractMotivated by error-correcting coding theory, we pose some hard questions regarding moduli sp...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
AbstractLet C be a smooth, geometrically connected, projective curve of genus g⩾2 defined over Fq. H...
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...
AbstractLet C be a nonsingular projective curve defined over a finite field. We give a construction ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
For a vector bundle E on a model of a smooth projective curve over a p-adic number field a p-adic re...
AbstractIt is known that a vector bundle E on a smooth projective curve Y defined over an algebraica...
In this paper we investigate linear error correcting codes and projective caps related to the Grass...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
AbstractLet X be a smooth projective curve of genus g⩾2 defined over an algebraically closed field k...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractMotivated by error-correcting coding theory, we pose some hard questions regarding moduli sp...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
AbstractLet C be a smooth, geometrically connected, projective curve of genus g⩾2 defined over Fq. H...
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...
AbstractLet C be a nonsingular projective curve defined over a finite field. We give a construction ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
For a vector bundle E on a model of a smooth projective curve over a p-adic number field a p-adic re...
AbstractIt is known that a vector bundle E on a smooth projective curve Y defined over an algebraica...
In this paper we investigate linear error correcting codes and projective caps related to the Grass...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
AbstractLet X be a smooth projective curve of genus g⩾2 defined over an algebraically closed field k...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractMotivated by error-correcting coding theory, we pose some hard questions regarding moduli sp...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
DOI
Add to ORKG