The maximum size of a partial spread. II: Upper bounds
From MaRDI portal
Publication:526224
DOI10.1016/j.disc.2017.02.001zbMath1367.51007arXiv1606.09208OpenAlexW2963222120MaRDI QIDQ526224
Papa Amar Sissokho, Esmeralda L. Năstase
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.09208
Related Items
The maximum size of a partial spread in a finite projective space, Improved upper bounds for partial spreads, New Lower Bounds for Binary Constant-Dimension Subspace Codes
Cites Work
- Unnamed Item
- Some necessary conditions for vector space partitions
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- On the length of the tail of a vector space partition
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partial spreads in finite projective spaces and partial designs
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- Improved upper bounds for partial spreads
- 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
- Coding for Errors and Erasures in Random Network Coding
- 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
