One of the main problems of subspace coding asks for the maximum possible cardinality of
a subspace code with minimum distance at least $ d $ over $\mathbb {F} _q^ n $, where the …

In the context of constant--dimension subspace codes, an important problem is to determine
the largest possible size $ A_q (n, d; k) $ of codes whose codewords are $ k $-subspaces of …

The main problem of constant-dimension subspace coding is to construct constant-
dimension codes (CDCs) with the maximum possible cardinality. Lifting Ferrers diagram …

A basic problem for the constant dimension subspace coding is to determine the maximal
possible size A q (n, d, k) of a set of k-dimensional subspaces in F nq such that the subspace …

A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common
vector space with upper bounded pairwise intersection. We improve and generalize two …

In this article, the effective lengths of all q r-divisible linear codes over F q with a non-
negative integer r are determined. For that purpose, the S q (r)-adic expansion of an integer …

A basic problem about a constant dimension subspace code is to find its maximal possible
size A q (n, d, k). In this paper, we investigate constant dimension codes with parallel linkage …

One of the main problems of subspace coding is to determine the maximal size of a constant
dimension subspace code with given parameters. In this paper, we show that mixed …

A basic problem about a constant dimension subspace code is to find its maximal possible
size A q (n, d, k). Linkage construction and inserting construction are two effective methods …

One of the main problems in subspace coding is to determine the maximal possible size of a
constant dimension subspace code with given parameters. In this paper, we introduce a …