Generalized linkage construction for constant-dimension codes
Combinatorics
2019-11-14 v3
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.
Keywords
Cite
@article{arxiv.1910.11195,
title = {Generalized linkage construction for constant-dimension codes},
author = {Daniel Heinlein},
journal= {arXiv preprint arXiv:1910.11195},
year = {2019}
}