AbstractWe show how to construct error-correcting codes from flag varieties on a finite field Fq. We give some examples. For some codes, we give the parameters and give the weights and the number of codewords of minimal weight
This note completes a talk given at the conference Curves over Finite Fields: past, present and futu...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
AbstractWe show how to construct error-correcting codes from flag varieties on a finite field Fq. We...
AbstractWe give a construction of error-correcting codes from Grassmann bundles associated to a vect...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractWe study the geometrical properties of the subgroups of the mutliplicative group of a finite...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
AbstractWe investigate the parameters of the algebraic–geometric codes constructed from vector bundl...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
This article gives new fast methods for decoding certain error-correcting codes by solving certain a...
This note completes a talk given at the conference Curves over Finite Fields: past, present and futu...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
AbstractWe show how to construct error-correcting codes from flag varieties on a finite field Fq. We...
AbstractWe give a construction of error-correcting codes from Grassmann bundles associated to a vect...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractWe study the geometrical properties of the subgroups of the mutliplicative group of a finite...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
We construct linear codes from scrolls over curves of high genus and study the higher support weight...
AbstractWe investigate the parameters of the algebraic–geometric codes constructed from vector bundl...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
This article gives new fast methods for decoding certain error-correcting codes by solving certain a...
This note completes a talk given at the conference Curves over Finite Fields: past, present and futu...
AbstractWe find PD-sets for some binary Grassmann codes, that is, for the projective Reed–Muller cod...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
DOI
Add to ORKG