• 10/18/2016 – AGNT Seminar
    Anna-Lena Horlemann – EPF Lausanne
    Linearized polynomial modules and their application to network coding – video
    Linearized polynomials are a certain family of polynomials over finite fields. They form a non-commutative ring with the two operations addition and composition. In this ring we will consider special modules of rank 2, which we call interpolation modules, and determine minimal (Gröbner) bases of these modules. Furthermore we give a brief introduction to network coding and show how linearized polynomials are used to construct optimal rank-metric codes, also called Gabidulin codes. In the network coding setting, the problem of decoding such a code can be translated to a parametrization based on a minimal basis of the interpolation module. We conclude our talk by explaining the parametrization and the decoding algorithm, and determining the complexity order of it.

Supported by the National Science Foundation (NSF) under Grant No. DMS:1547399. Any opinions, findings and conclusions or recommendations expressed in these materials are those of the authors and do not necessarily reflect the views of NSF.