Classification of large partial plane spreads in and related combinatorial objects
arXiv:1606.07655 · doi:10.1007/s00022-018-0459-6
Abstract
In this article, the partial plane spreads in of maximum possible size and of size are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space partitions of of type , binary MRD codes of minimum rank distance , and subspace codes with parameters and .
arXiv comment31 pages, 9 tables
References in corpus (13)
- A Rank-Metric Approach to Error Control in Random Network Coding
- Dancing links
- Tables of subspace codes
- Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4
- Coset Construction for Subspace Codes
- Algebraic structures of MRD Codes
- Partial spreads and vector space partitions
- New Criteria for MRD and Gabidulin Codes and some Rank-Metric Code Constructions
- Derived and Residual Subspace Designs
- Improved upper bounds for partial spreads
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Canonical Forms and Automorphisms in the Projective Space
- New LMRD bounds for constant dimension codes and improved constructions