On Ferrers Diagram Codes
Rank-metric codes play a crucial role in the area of random network coding. Mathematically, they are subspaces of a matrix space 
over a finite field 
, and where the matrix space is endowed with the rank metric. Ferrers diagram codes are rank-metric codes where each matrix in the code has its support in a pre-specified Ferrers diagram. A natural coding theoretic question is: how large can such a code be if the rank of all its nonzero matrices is lower bounded by a given value. In this talk I will report on this maximum possible dimension and present known and new constructions of Ferrers diagram codes with prescribed rank distance and maximum dimension.
