Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

Rank-metric codes and MacWilliams identities

Talk by Prof. Dr. Alberto Ravagnani

Date: 23.03.15  Time: 13.00 - 14.00  Room: Y27H28

Delsarte rank-metric codes are linear spaces of matrices over a finite field with rank bounded from below. They have several applications in information theory, mostly in network coding. In this talk we focus on MacWilliams identities for Delsarte codes. In coding theory, a MacWilliams identity is a relation between metric properties of a code and metric properties of the dual code, usually expressed in the form of a numerical equation. MacWilliams identities for Delsarte codes were first proved by Delsarte in 1978 employing quite sophisticated combinatorial tools (association schemes, regular semilattices, Schur rings). We present a new simple approach to MacWilliams identities for Delsarte codes, re-establishing them only employing elementary techniques. We also give a different formulation of the same MacWilliams identities, and show how to use them (in the new form) to derive general properties of Delsarte codes in a concise way. We then relate Delsarte codes with Gabidulin codes (an other family of rank-metric codes) proving that the duality theory of Delsarte codes can be regarded as a generalization of the duality theory of Gabidulin codes. Finally, we present an application of our results in enumerative combinatorics, solving in an elementary way a classical problem whose standard solution involves the theory of algebraic groups.