Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6

DOI10.1007/s10623-018-0544-8zbMath1409.51010arXiv1711.06624OpenAlexW3100677317WikidataQ129300699 ScholiaQ129300699MaRDI QIDQ1727355

Daniel Heinlein, Thomas Honold, Alfred Wassermann, Sascha Kurz, Michael Kiermaier

Publication date: 20 February 2019

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

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

zbMATH Keywords

classificationinteger linear programmingnetwork codingsubspace distanceconstant-dimension codes

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Spreads and packing problems in finite geometry (51E23)

Related Items (27)

New constant dimension subspace codes from block inserting constructions ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Subspace code constructions ⋮ Distance distributions of cyclic orbit codes ⋮ Improved upper bounds for partial spreads ⋮ Construction of constant dimension codes via improved inserting construction ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ LCD subspace codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes ⋮ Subspace packings: constructions and bounds ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ Abelian non-cyclic orbit codes and multishot subspace codes ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Bounds for flag codes ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Generalized vector space partitions ⋮ Subspaces intersecting in at most a point ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Johnson type bounds for mixed dimension subspace codes ⋮ Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code ⋮ Self-orthogonal codes from equitable partitions of association schemes

Uses Software

• CPLEX
• Cliquer

Cites Work

• Constructions and bounds for mixed-dimension subspace codes
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• Galois geometries and coding theory
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• Partial spreads in finite projective spaces and partial designs
• Bilinear forms over a finite field, with applications to coding theory
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• 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
• Improved upper bounds for partial spreads
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Codes and Designs Related to Lifted MRD Codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Coding for Errors and Erasures in Random Network Coding
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Error-Correcting Codes in Projective Space
• Maximum-rank array codes and their application to crisscross error correction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6