AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes over Fq. As a consequence, one obtains an asymptotic formula for this number. These results also apply for the number of inequivalent representations over Fq of the uniform matroid or, alternately, the number of Fq-rational points of certain open strata of Grassmannians. The techniques used in the determination of bounds for the number of MDS codes are applied to deduce several geometric properties of certain sections of Grassmannians by coordinate hyperplanes
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
AbstractWe define a class of codes that corresponds to a class of matroids called paving matroids. T...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
AbstractWe define a class of codes that corresponds to a class of matroids called paving matroids. T...
AbstractIn this article we study the codes given by l hypersurfaces in Pnq to obtain a new formula f...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new...
AbstractWe consider linear error correcting codes associated to higher-dimensional projective variet...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...