Extremal sizes of subspace partitions
From MaRDI portal
Publication:438885
DOI10.1007/s10623-011-9572-3zbMath1255.51008arXiv1104.2706OpenAlexW2106235829MaRDI QIDQ438885
Papa Amar Sissokho, Juliane Lehmann, Esmeralda L. Năstase, Olof Heden
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2706
Steiner systems in finite geometry (51E10) Spreads and packing problems in finite geometry (51E23) Finite partial geometries (general), nets, partial spreads (51E14)
Related Items
Partial spreads in random network coding, The supertail of a subspace partition, On the type(s) of minimum size subspace partitions, The structure of the minimum size supertail of a subspace partition, Sharp covering of a module by cyclic submodules, The complete characterization of the minimum size supertail in a subspace partition, Invariant codes, difference schemes, and distributive quasigroups
Cites Work
- The minimum size of a finite subspace partition
- 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 vector space partitions and uniformly resolvable designs
- Existence and construction of randomization defining contrast subspaces for regular factorial designs
- On the length of the tail of a vector space partition
- Partitions of finite Abelian groups
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitions of a vector space
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- On maximal partial spreads in \(PG\)(\(n\), \(q\))
- Small maximal partial \(t\)-spreads
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Partitions of the 8-dimensional vector space over GF(2)
- Blocking sets in PG(2, p) for small p, and partial spreads in PG(3,7)
- A General Class of Maximal Codes ror Computer Applications
- Group Partition, Factorization and the Vector Covering Problem
- A maximal partial spread of size 45 in \(PG(3,7)\)
- Unnamed Item
- Unnamed Item