AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rational points of the Segre variety over a finite field K is given. The dimension as well as the minimum distance of a Reed–Muller-type linear code defined over SK are also determined. An example is given to illustrate the ideas
AbstractThis paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. ...
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimu...
We explore the connections between finite geometry and algebraic coding theory, giving a rather full...
The a-invariant is determined and a description of the defining ideal for the set SK of rational poi...
AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rati...
In this essay we introduce the projective Reed-Muller-type codes over finite fields and explore its ...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
AbstractWe give a brief but complete account of all the essential facts concerning the Reed-Muller a...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
Constant dimension codes are subsets of the finite Grassmann variety. The subspace distance is a nat...
AbstractThis paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. ...
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimu...
We explore the connections between finite geometry and algebraic coding theory, giving a rather full...
The a-invariant is determined and a description of the defining ideal for the set SK of rational poi...
AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rati...
In this essay we introduce the projective Reed-Muller-type codes over finite fields and explore its ...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
AbstractWe give a brief but complete account of all the essential facts concerning the Reed-Muller a...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
We consider linear error correcting codes associated to higher-dimensional projective varieties defi...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
Constant dimension codes are subsets of the finite Grassmann variety. The subspace distance is a nat...
AbstractThis paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. ...
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimu...
We explore the connections between finite geometry and algebraic coding theory, giving a rather full...
DOI
Add to ORKG