2000 character limit reached
Generalized linkage construction for constant-dimension codes
Published 24 Oct 2019 in math.CO | (1910.11195v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.