Coset construction for subspace codes

Titelangaben

Heinlein, Daniel ; Kurz, Sascha:
Coset construction for subspace codes.
Bayreuth , 2015 . - 17 S.

Volltext

Link zum Volltext (externe URL):

Angaben zu Projekten

Abstract

One of the main problems of the young research area of network coding is to compute good lower and upper bounds of the achievable so-called subspace codes in PG(n,q) 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 several of the previously best known subspace codes and attains the MRD bound for an infinite family of parameters.