Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

Combining subspace codes

Vortrag von Prof. Dr. Sascha Kurz

Datum: 18.03.20  Zeit: 15.00 - 16.00  Raum: Y16G05 CANCELLED

Codes in the projective space and codes in the Grassmannian over a finite field - referred to as subspace codes and constant-dimension codes, respectively - have been proposed for error control in random linear network coding. An important problem is to determine the corresponding largest possible sizes of these codes. Here we investigate several approaches to combine subspace codes to larger codes. The interplay of the subspace distance, the Hamming distance and the rank metric allows us to present improvements on the lower bounds for many parameters. This is joint work with Antonio Cossidente, Giuseppe Marino, and Francesco Pavese.