Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4

Abstract

It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\mathrm{PG}(5,2)$ mutually intersecting in at most a point is $77$. Optimal binary $(v,M,d;k)=(6,77,4;3)$ subspace codes are classified into $5$ isomorphism types, and a computer-free construction of one isomorphism type is provided. The construction uses both geometry and finite fields theory and generalizes to any $q$, yielding a new family of $q$-ary $(6,q^6+2q^2+2q+1,4;3)$ subspace codes.

References in corpus (2)

• Problems on q-Analogs in Coding Theory
• Canonical Forms and Automorphisms in the Projective Space

Cited by in corpus (20)

• Tables of subspace codes
• Coset Construction for Subspace Codes
• Partial spreads and vector space partitions
• Combining subspace codes
• Large sets of subspace designs
• On putative q-Analogues of the Fano Plane and Related Combinatorial Structures
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• On the lengths of divisible codes
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Classification of large partial plane spreads in $PG(6,2)$ and related combinatorial objects
• Subspace Packings -- Constructions and Bounds
• A New Approach to the Main Problem of Subspace Coding
• The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes
• A new upper bound for subspace codes
• New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks
• A subspace code of size $333$ in the setting of a binary $q$-analog of the Fano plane
• Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction
• On projective $q^r$-divisible codes
• Generalized vector space partitions
• Intersection Patterns in Optimal Binary $(5,3)$ Doubling Subspace Codes