ICE Speaker Series: Dr. Alain Couvreur - On the hardness of the code equivalence problem in rank metric

On December 02, 2020 at 4:00 PM, Dr. Alain Couvreur from Inria will be giving a talk in the ICE Speaker Series about "On the hardness of the code equivalence problem in rank metric".

On the hardness of the code equivalence problem in rank metric

Dr. Alain Couvreur

Inria Saclay Center - Île-de-France

Join via Zoom:
tum-conf.zoom.us/j/97841803777
Meeting ID: 978 4180 3777
Passcode: 243907

 

Slides

Abstract:

In this talk, we discuss the code equivalence problem in rank metric. For F_{q^m}--linear codes, which is the most commonly studied case of rank metric codes, we prove that the problem can be solved in polynomial case with an algorithm which is "worst case". On the other hand, the problem can be stated for general matrix spaces. In this situation, we are able to prove that this problem is at least as hard as the monomial equivalence for codes endowed with the Hamming metric.

This is a common work with Thomas Debris Alazard and Philippe Gaborit