Coset Construction for Subspace Codes

Titelangaben

Heinlein, Daniel ; Kurz, Sascha:
Coset Construction for Subspace Codes.
In: IEEE Transactions on Information Theory. Bd. 63 (2017) Heft 12 . - S. 7651-7660.
ISSN 0018-9448
DOI: https://doi.org/10.1109/TIT.2017.2753822

Angaben zu Projekten

Abstract

One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in Pq(n), i.e., the set of subspaces of Fnq , for a given minimal distance. Here we generalize a construction of Etzion and Silberstein to a wide range of parameters. This construction, named coset construction, improves or attains several of the previously best-known subspace code sizes and attains the MRD bound for an infinite family of parameters.