We introduce a subclass of linear vector codes called Rank codes.
These codes reach the upper Singleton bound in the rank metric and therefore
they are called maximum rank distance (MRD) codes. The vector representation
of the linear rank metric codes allows an efficient decoding algorithm, which made the rank codes ready for practical applications, as for instance network coding or code-based cryptography.
Shedule (all lectures will in presence and in streaming, at the zoom link of the course Computational Algebra).
Thursday 7/4 14.30-16.30 Aula H
Friday 8/4 9.30-11.30 Aula G
Monday 11/4 11.30/13.30 Aula G
Wednesday 13/4 14.30-16.30 Aula G