Related papers: Multilevel constructions of constant dimension cod…
Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given parameters. Inserting construction and multilevel construction…
Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size $A_q(n,d,\{k\})$ for given…
Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental research problem of CDCs is to determine the maximum number of…
Subspace codes, especially constant dimension subspace codes (CDCs), represent an intriguing domain that can be used to conduct basic coding theory investigations. They have received widespread attention due to their applications in random…
Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs),…
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 constructions for CDCs, the improved linkage construction and the…
Constant dimension codes are e.g. used for error correction and detection in random linear network coding, so that constructions for these codes have achieved wide attention. Here, we improve over 150 lower bounds by describing better…
Constant-dimension codes (CDCs) have been investigated for noncoherent error correction in random network coding. The maximum cardinality of CDCs with given minimum distance and how to construct optimal CDCs are both open problems, although…
Constant dimension codes are used for error control in random linear network coding, so that constructions for these codes with large cardinality have achieved wide attention in the last decade. Here, we improve the so-called linkage…
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the…
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 Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…
The linkage construction and its generalization is one of the most powerful constructions for constant dimension code, accounting for approximately 50\% of all the listed parameters. We show how to improve the linkage construction of…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…