Generalized vector space partitions

Abstract

A vector space partition $\mathcal{P}$ in ${\mathbb{F}}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of ${\mathbb{F}}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every $t$-dimensional subspace", we generalize this notion to vector space $t$-partitions and study their properties. There is a close connection to subspace codes and some problems are even interesting and unsolved for the set case $q=1$.

arXiv comment12 pages, typos corrected

References in corpus (9)

• A Rank-Metric Approach to Error Control in Random Network Coding
• Tables of subspace codes
• Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4
• Partial spreads and vector space partitions
• Intersection numbers for subspace designs
• The order of the automorphism group of a binary $q$-analog of the Fano plane is at most two
• On the automorphism group of a binary $q$-analog of the Fano plane
• Projective divisible binary codes
• Heden's bound on the tail of a vector space partition