List decoding constant dimension codes in their Plücker embedding

Anna-Lena Trautmann

Institut für Mathematik
Universität Zürich
Winterthurerstrasse 190
CH-8057 Zürich

Abstract:

Constant dimension codes have found applications in random network coding and distributed storage, among others. A constant dimension code is defined to be a subset of the Grassmannian G_q(k,n), which is the set of all k-dimensional vector subspaces of F_q^n. List decoding is the method of finding not only the codeword closest to a received word, but the complete list of codewords that are inside a ball of a given radius around the received word. In this talk we will show how the Plücker embedding, which is a classical tool when working with the Grassmannian, can be used to establish a list decoding algorithm for some families of constant dimension codes that works by just solving a system of bilinear equations in the embedding.

Biography:

Since 2009 Anna-Lena Trautmann has been a PhD student at University of Zürich (Switzerland) working under the supervision of Joachim Rosenthal in the applied algebra group. Prior to this, she acquired a diploma in Mathematics at the Ruhr-Universität Bochum (Germany).