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
The Sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...
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...
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractIn this paper we continue the investigation of a family of linear block codes based on the g...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes...
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannia...
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal dis...
The Sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...
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...
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new...
AbstractWe consider the question of determining the maximum number of points on sections of Grassman...
We consider the question of determining the maximum number of points on sections of Grassmannians ov...
Abstract. We discuss the problem of determining the complete weight hier-archy of linear error corre...
AbstractFor generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight,...
AbstractIn this paper we continue the investigation of a family of linear block codes based on the g...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes...
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannia...
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal dis...
The Sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...