The geometry behind MRD codes
Geertrui van de Voorde
School of Mathematics and Statistics University of Canterbury
Date: Tuesday 16 April 2019
Time: 11:00 a.m.
Place: Room241, 2nd floor, Science III building
Rank-metric codes are widely seen in a variety of applications ranging from storing information in the cloud to public-key cryptosystems. For over thirty years, the only optimal rank-metric codes known were Gabidulin codes. This changed when Sheekey recently constructed a new family of optimal rank-metric codes (MRD codes) using objects from finite geometry called linear sets on a projective line. In this talk, I will explain the interplay between rank-metric codes and linear sets.