Classification of large partial plane spreads in PG(6,2) and related combinatorial objects

DOI10.1007/S00022-018-0459-6MaRDI QIDQ669602zbMATH OpenOpenAlexFDO

Authors Thomas Honold, Michael Kiermaier, Sascha Kurz

Publication date 15 March 2019

Published in Journal of Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.07655

zbMATH Keywords

subspace codesvector space partitions of \(\mathrm{PG}(6,2)\)

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Canonical forms, reductions, classification (15A21) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial structures in finite projective spaces (51E20) Other types of codes (94B60) Finite partial geometries (general), nets, partial spreads (51E14)

Abstract: In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space partitions of $PG(6,2)$ of type $(3^{16}{4}^1)$, binary $3imes4$ MRD codes of minimum rank distance $3$, and subspace codes with parameters $(7,17,6{)}_2$ and $(7,34,5{)}_2$.

Recommendations

• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Improved upper bounds for partial spreads
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Maximal partial spreads and two-weight codes
• On the non-existence of a maximal partial spread of size 76 in \(PG(3,9)\)

Cites work

• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 6813620 (Why is no real title available?)
• scientific article; zbMATH DE number 905159 (Why is no real title available?)
• scientific article; zbMATH DE number 3340304 (Why is no real title available?)
• scientific article; zbMATH DE number 6541785 (Why is no real title available?)
• A General Class of Maximal Codes ror Computer Applications
• A Rank-Metric Approach to Error Control in Random Network Coding
• A new family of linear maximum rank distance codes
• A survey of the different types of vector space partitions
• Algebraic structures of MRD codes
• Automorphism groups of Gabidulin-like codes
• Bilinear forms over a finite field, with applications to coding theory
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Codes and Designs Related to Lifted MRD Codes
• Codes and projective multisets
• Coding for Errors and Erasures in Random Network Coding
• Constructions and bounds for mixed-dimension subspace codes
• Coset Construction for Subspace Codes
• Derived and residual subspace designs
• Error-Correcting Codes in Projective Space
• Galois geometries and coding theory
• Improved upper bounds for partial spreads
• Line spreads of PG(5, 2)
• Linear codes over finite chain rings
• Maximum-rank array codes and their application to crisscross error correction
• New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
• New criteria for MRD and Gabidulin codes and some rank-metric code constructions
• On the length of the tail of a vector space partition
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Partial spreads in finite projective spaces and partial designs
• Partitions of finite vector spaces over \(\mathrm{GF}(2)\) into subspaces of dimensions 2 and \(s\)
• Partitions of the 8-dimensional vector space over GF(2)
• Subsets of PG\((n,2)\) and maximal partial spreads in PG\((4,2)\)
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• The Magma algebra system. I: The user language
• The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• The maximum size of a partial spread in a finite projective space
• Theory of codes with maximum rank distance

Cited in

(7)

• The interplay of different metrics for the construction of constant dimension codes
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• scientific article; zbMATH DE number 6298612 (Why is no real title available?)
• Johnson type bounds for mixed dimension subspace codes
• Isomorphism check for \(2^n\) factorial designs with randomization restrictions
• Generalized vector space partitions
• Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set

Describes a project that uses

Uses Software

• Magma
• Cliquer
• libexact

This page was built for publication: Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects

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