The maximum size of a partial spread in a finite projective space
From MaRDI portal
Publication:2401987
DOI10.1016/j.jcta.2017.06.012zbMath1375.51003arXiv1605.04824OpenAlexW2964320238MaRDI QIDQ2401987
Esmeralda L. Năstase, Papa Amar Sissokho
Publication date: 5 September 2017
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.04824
Combinatorial structures in finite projective spaces (51E20) Finite partial geometries (general), nets, partial spreads (51E14)
Related Items (11)
Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ The chromatic index of finite projective spaces ⋮ Combining subspace codes ⋮ Domination mappings into the Hamming ball: existence, constructions, and algorithms ⋮ New lower bounds for partial k‐parallelisms ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Subspace partitions of \(\mathbb{F}_q^n\) containing direct sums ⋮ A stability result and a spectrum result on constant dimension codes ⋮ Generalized vector space partitions ⋮ Johnson type bounds for mixed dimension subspace codes
Cites Work
- Unnamed Item
- The maximum size of a partial spread. II: Upper bounds
- Some necessary conditions for vector space partitions
- Kneser's conjecture, chromatic number, and homotopy
- Colouring lines in projective space
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Galois geometries and coding theory
- A Hilton-Milner theorem for vector spaces
- The Erdős-Ko-Rado theorem for vector spaces
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partial spreads in finite projective spaces and partial designs
- Intersection theorems for systems of finite vector spaces
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Partial spreads in random network coding
- Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
- A SURVEY OF THE DIFFERENT TYPES OF VECTOR SPACE PARTITIONS
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Perfect byte-correcting codes
- Error-Correcting Codes in Projective Space
- A General Class of Maximal Codes ror Computer Applications
- Group Partition, Factorization and the Vector Covering Problem
- A survey of perfect codes
This page was built for publication: The maximum size of a partial spread in a finite projective space