AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements
AbstractWe present an upper bound on the number of regions into which affine space or the torus over...
International audienceWe consider the question of determining the maximum number of Fq-rational poin...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractFor generalized Reed–Muller, GRM(q,d,n), codes, the determination of the second weight is st...
AbstractThe weight distribution of the generalized Reed–Muller codes over the finite field Fq is lin...
AbstractWe study first some arrangements of hyperplanes in the n-dimensional projective space Pn(Fq)...
AbstractWe generalize a recent idea for constructing codes over a finite field Fq by evaluating a ce...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in ...
AbstractWe consider systems of homogenous polynomial equations of degreedin a projective space Pmove...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
AbstractLet Fq be the finite field with q elements of characteristic p, Fqm be the extension of degr...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
We give a complete conjectural formula for the number er(d, m) of maximum possible Fq-rational point...
We present bounds on the number of points in algebraic curves and algebraic hypersurfaces in P-n(F-q...
AbstractWe present an upper bound on the number of regions into which affine space or the torus over...
International audienceWe consider the question of determining the maximum number of Fq-rational poin...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractFor generalized Reed–Muller, GRM(q,d,n), codes, the determination of the second weight is st...
AbstractThe weight distribution of the generalized Reed–Muller codes over the finite field Fq is lin...
AbstractWe study first some arrangements of hyperplanes in the n-dimensional projective space Pn(Fq)...
AbstractWe generalize a recent idea for constructing codes over a finite field Fq by evaluating a ce...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in ...
AbstractWe consider systems of homogenous polynomial equations of degreedin a projective space Pmove...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
AbstractLet Fq be the finite field with q elements of characteristic p, Fqm be the extension of degr...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
We give a complete conjectural formula for the number er(d, m) of maximum possible Fq-rational point...
We present bounds on the number of points in algebraic curves and algebraic hypersurfaces in P-n(F-q...
AbstractWe present an upper bound on the number of regions into which affine space or the torus over...
International audienceWe consider the question of determining the maximum number of Fq-rational poin...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...