Parallel versions of the linkage construction and of multi-block lifted MRD codes yield new lower bounds on A_q(n,d,k), beating the previous tables in more than 110 cases.
Generalized linkage construction for constant-dimension codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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 parallel linkage construction, to the generalized linkage construction which in turn yields many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks
Parallel versions of the linkage construction and of multi-block lifted MRD codes yield new lower bounds on A_q(n,d,k), beating the previous tables in more than 110 cases.