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

orthogonal arrayspartial spreadsGalois geometryvector space partitionsconstant dimension codes\((s , r , \mu )\)-nets

Mathematics Subject Classification ID

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

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$.

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

(25)

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

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)