The maximum size of a partial 3-spread in a finite vector space over GF(2)

DOI10.1007/S10623-009-9311-1MaRDI QIDQ849358zbMATH OpenOpenAlexFDO

Authors S. I. El-Zanati, Heather Jordon, George F. Seelinger, Papa A. Sissokho, Lawrence E. Spence

Publication date 25 February 2010

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-009-9311-1

zbMATH Keywords

orthogonal arrayspartial spreadsspreads\((s,k,\lambda)\)-nets

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial aspects of packing and covering (05B40) Finite partial geometries (general), nets, partial spreads (51E14)

Recommendations

• The maximum size of a partial spread in a finite projective space
• Improved upper bounds for partial spreads
• The maximum size of a partial spread. II: Upper bounds
• scientific article; zbMATH DE number 6813620
• Extremal sizes of subspace partitions

Cites work

• scientific article; zbMATH DE number 68348 (Why is no real title available?)
• A General Class of Maximal Codes ror Computer Applications
• A maximal partial spread of size 45 in \(PG(3,7)\)
• A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
• Maximal partial spreads and the modular \(n\)-queen problem. III
• On a particular class of minihypers and its applications. I: The result for general q
• On maximal partial spreads in PG(n, q)
• On partitions of finite vector spaces of low dimension over \(\text{GF}(2)\)
• On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
• On vector space partitions and uniformly resolvable designs
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Partitions of a vector space
• Partitions of finite Abelian groups
• Partitions of finite vector spaces: an application of the Frobenius number in geometry
• The maximum size of a partial spread in \(H(5,q^{2})\) is \(q^{3}+1\)

Cited in

(23)

• Partial spreads in random network coding
• Optimal binary linear locally repairable codes with disjoint repair groups
• New lower bounds for binary constant-dimension subspace codes
• The maximum size of a partial spread in a finite projective space
• Bounds on a class of partial partitions of a vector space over gf(2):a graph theoretical approach
• A survey of the different types of vector space partitions
• The functional characteristic of maximal 3 linearly independent array
• Gaussian partitions
• Improved upper bounds for partial spreads
• Partitions of the 8-dimensional vector space over GF(2)
• Construction of subspace codes through linkage
• Multicomponent codes with maximum code distance
• Galois geometries and coding theory
• Vector space partitions of GF(2)^8
• Optimal binary and ternary locally repairable codes with minimum distance 6
• Extremal sizes of subspace partitions
• Affine and combinatorial binary m-spaces
• Equidistant codes in the Grassmannian
• The minimum size of a finite subspace partition
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• Partitions of finite vector spaces over \(\mathrm{GF}(2)\) into subspaces of dimensions 2 and \(s\)
• Cyclic orbit codes and stabilizer subfields
• The maximum size of a partial spread. II: Upper bounds

This page was built for publication: The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849358)