The Sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-Varshamov bound on the subspace codes n+l,M,d,(m,1)q based on subspaces of type (m,1) in singular linear space Fq(n+l) over finite fields Fq are presented. Then, we prove that codes based on subspaces of type (m,1) in singular linear space attain the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures in Fq(n+l)
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
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...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
A subspace code of length n over the finite field Fq is a collection of subspaces of the n -...
We consider a class of linear codes associated to projective algebraic varieties defined by the vani...
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal dis...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
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...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
A subspace code of length n over the finite field Fq is a collection of subspaces of the n -...
We consider a class of linear codes associated to projective algebraic varieties defined by the vani...
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal dis...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...