Improved upper bounds for partial spreads

DOI10.1007/S10623-016-0290-8MaRDI QIDQ2402972zbMATH OpenOpenAlexFDO

Authors Sascha Kurz

Publication date 15 September 2017

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

Full work available at URL https://arxiv.org/abs/1512.04297, https://epub.uni-bayreuth.de/2636/1/improving_partial_spreads_arxiv.pdf

zbMATH Keywords

\((s , r , \mu )\)-netsconstant dimension codesGalois geometryorthogonal arrayspartial spreadsvector space partitions

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Spreads and packing problems in finite geometry (51E23) Combinatorial codes (94B25)

Abstract: A partial $(k-1)$-spread in $operatornamePG(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in $operatornamePG(n-1,q)$ was known for the cases $nequiv0pmodk$, $nequiv1pmodk$ and $nequiv2pmodk$ with the additional requirements $q=2$ and $k=3$. We completely resolve the case $nequiv2pmodk$ for the binary case $q=2$.

Review text

A partial \((k-1)\)-spread of \(\mathrm{PG}(n-1,q)\) is a set of mutually disjoint \((k-1)\)-dimensional subspaces. A partial \((k-1)\)-spread in \(\mathrm{PG}(n-1,q)\) corresponds to a constant dimension subspace code in \(V(n,q)\), where codewords have dimension \(k\) and the minimumdistance is \(2k\). The maximum number of codewords in such a code is denoted by \(A_q(n,2k;k)\). A trivial upper bound for the size of a partial spread is given by \(\frac{q^n-1}{q^k-1}\). This bound is attained if and only if \(n\) is \(0\) mod \(k\) and in this case, we find a spread of \(\mathrm{PG}(n-1,q)\). In the case that \(n\equiv 1\) mod \(k\), \textit{A. Beutelspacher} [Math. Z. 145, 211--229 (1975; Zbl 0297.50018)] proved that \(A_q(n,2k;k)=\frac{q^n-q^{k+1}+q^k-1}{q^k-1}\). The best known upper bound for \(A_q(n,2k;k)\) for \(n\) different from \(0\) or \(1\) mod \(k\) is given in [\textit{D. A. Drake} and \textit{J. W. Freeman}, J. Geom. 13, 210--216 (1979; Zbl 0428.51004)]. In this paper, the author determines \(A_q(n,2k;k)\) in the case that \(q=2\) and \(n\) is congruent to \(2\) mod \(k\). The main theorem is that for integers \(t\geq 2\) and \(k\geq 4\), we have that \[ A_2(kt+2,2k;k)=\frac{2^{kt+2}-3.2^k-1}{2^k-1}. \] The proof consists of a combinatorial argument based on the intersection of a partial spread with a hyperplane, and boils down to a clever combination of the main theorem of [loc. cit.] with more recent work on the tail of a subspace [\textit{O. Heden}, Discrete Math. 309, No. 21, 6169--6180 (2009; Zbl 1235.51013)].

Recommendations

• The maximum size of a partial spread. II: Upper bounds
• The maximum size of a partial spread in a finite projective space
• Small maximal partial t-spreads
• scientific article; zbMATH DE number 6813620
• Maximal partial spreads and two-weight codes

Cites work

• A General Class of Maximal Codes ror Computer Applications
• A Rank-Metric Approach to Error Control in Random Network Coding
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Galois geometries and coding theory
• On the length of the tail of a vector space partition
• Partial spreads in finite projective spaces and partial designs
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Recursive Code Construction for Random Networks
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• The maximum size of a partial spread. II: Upper bounds
• The supertail of a subspace partition
• Theory of codes with maximum rank distance
• Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe

Cited in

(26)

• Maximal partial spreads and two-weight codes
• Partial spreads over \({\mathbb{Z}}_ q\)
• On the size of a maximal partial spread
• New lower bounds for the Randić spread
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• An asymptotically optimal construction of almost affinely disjoint subspaces
• Flag codes: distance vectors and cardinality bounds
• Johnson type bounds for mixed dimension subspace codes
• The maximum size of a partial spread in a finite projective space
• On the extendability of particular classes of constant dimension codes
• scientific article; zbMATH DE number 3868100 (Why is no real title available?)
• New lower bounds for binary constant-dimension subspace codes
• Generalized partial spreads
• Optimal binary linear locally repairable codes with disjoint repair groups
• On network codes and partial spreads
• Partial k-parallelisms in finite projective spaces
• The maximum size of a partial spread. II: Upper bounds
• Generalized vector space partitions
• Almost affinely disjoint subspaces and covering Grassmannian codes
• New lower bounds for partial k‐parallelisms
• Reconfiguration of subspace partitions
• Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
• On linear partial spreads
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• The second minimum size of a finite subspace partition
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)

This page was built for publication: Improved upper bounds for partial spreads

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