Generalized vector space partitions

zbMath1411.05023arXiv1803.10180MaRDI QIDQ5377019

Daniel Heinlein, Michael Kiermaier, Thomas Honold, Sascha Kurz

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1803.10180

zbMATH Keywords

vector space designsvector space \(t\)-partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Other designs, configurations (05B30)

Related Items

Vector space partitions of GF(2)^8 ⋮ Subspace packings: constructions and bounds ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the automorphism group of a binary \(q\)-analog of the Fano plane
• On \(\lambda \)-fold partitions of finite vector spaces and duality
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• On the length of the tail of a vector space partition
• Theory of codes with maximum rank distance
• Partitions of finite Abelian groups
• Designs and partial geometries over finite fields
• Partial spreads in finite projective spaces and partial designs
• Bilinear forms over a finite field, with applications to coding theory
• The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Residual \(q\)-Fano planes and related structures
• Heden's bound on the tail of a vector space partition
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
• The maximum size of a partial spread in a finite projective space
• Improved upper bounds for partial spreads
• Partial parallelisms in finite projective spaces
• Upper bounds for constant-weight codes
• On the existence of a (2,3)-spread in V(7,2)
• A SURVEY OF THE DIFFERENT TYPES OF VECTOR SPACE PARTITIONS
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Partitions of the 8-dimensional vector space over GF(2)
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• A Rank-Metric Approach to Error Control in Random Network Coding
• Bounds for binary codes of length less than 25
• Partial ‐Parallelisms in Finite Projective Spaces
• Maximal consistent families of triples
• Intersection Numbers For Subspace Designs
• Maximum-rank array codes and their application to crisscross error correction
• Bose-Burton type theorems for finite Grassmannians