The interplay of different metrics for the construction of constant dimension codes

  title={The interplay of different metrics for the construction of constant dimension codes},
  author={Sascha Kurz},
  • Sascha Kurz
  • Published 29 July 2021
  • Mathematics, Computer Science
  • ArXiv
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies $d_S(U,W):=2k-2\dim(U\cap W)\ge d$ for all pairs of different codewords $U$, $W$. Constant dimension codes have applications in e.g.\ random linear network coding, cryptography, and distributed storage. Bounds for $A_q(n,d;k)$ are the topic of many recent research papers… Expand

Tables from this paper


Parameter-controlled inserting constructions of constant dimension subspace codes
Several new better lower bounds which are better than all previously constructive lower bounds can be derived from the flexible inserting constructions of constant dimension subspace codes proposed. Expand
Combining subspace codes
Improvements on the lower bounds for constant--dimension subspace codes for many parameters are presented, including A_q(10, 4; 5)$, $A-q(12, 4); 4), $A_q (12, 6, 6)$. Expand
Tables of subspace codes
The aim of this recurrently updated technical report is to provide a user guide how this technical tool can be used in research projects and to describe the so far implemented theoretic and algorithmic knowledge. Expand
Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4
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 maximumExpand
On putative q-analogues of the Fano plane and related combinatorial structures
A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane ifExpand
Bounds for the multilevel construction
This work considers the multilevel Echelon--Ferrers construction and gives lower and upper bounds for the achievable cardinalities, and solves maximum clique problems in weighted graphs, where the weights can be polynomials in the field size $q$. Expand
Coset Construction for Subspace Codes
A construction of Etzion and Silberstein to a wide range of parameters is generalized and improves or attains several of the previously best-known subspace code sizes and attains the maximum-rank distance bound for an infinite family of parameters. Expand
Parallel Multilevel Constructions for Constant Dimension Codes
This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs), to generalize the parallel construction in [Xu and Chen, IEEE Trans. Inf. Theory, 64 (2018), 6315–6319] and the classic multilevel construction. Expand
Subspace Codes in PG(2N − 1, Q)
The size of these codes is considerably larger than all known constructions so far, whenever n > 4 and when n = 4 a further improvement is provided by constructing an (8,M,4;4)q constant-dimension subspace code. Expand
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
A slightly improved version of the so-called linkage construction, used to construct constant dimension codes with subspace distance, dimension of the codewords for all field sizes q, and sufficiently large dimensions v of the ambient space, is presented. Expand