Cyclic subspace codes and sidon spaces
Netanel Raviv, Itzhak Tamo · 2017
The interest in subspace codes has increased in recent years due to their application in error correction for random network coding. In order to study their properties and find good constructions, the notion of cyclic subspace codes was introduced by using the extension field structure of the ambient space. However, to this date there exists no general construction with a polynomial relation between k, the dimension of the codewords, and n, the dimension of the entire space. Independently of the study of cyclic subspace codes, sSidon spaces were recently introduced by Bachoc et al. as a tool for the study of certain multiplicative properties of subspaces over finite fields. In this paper it is shown that Sidon spaces are necessary and sufficient for obtaining a full-orbit cyclic subspace code with minimum distance 2 k - 2. By presenting several constructions of Sidon spaces, full-orbit cyclic subspace codes are obtained, in which n is quadratic in k. The constructions are based on a variety of tools; namely, Sidon sets, that are sets of integers in which all pairwise sums are distinct, irreducible polynomials, and linearized polynomials. Further, the existence of a Sidon space in which n is linear in k is shown, alongside the fact that any Sidon space induces a Sidon set.