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

DOI10.1007/S00022-018-0459-6zbMATH Open1407.05042arXiv1606.07655OpenAlexW2952260679MaRDI QIDQ669602FDOQ669602

Michael Kiermaier, Sascha Kurz, Thomas Honold

Publication date: 15 March 2019

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

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

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

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)\)

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)

Cites Work

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

Cited In (7)

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

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)