Automorphism groups and new constructions of maximum additive rank metric codes with restrictions.

Let d , n ∈ Z + such that 1 ≤ d ≤ n. A d -code C ⊂ F q n × n is a subset of order n square matrices with the property that for all pairs of distinct elements in C , the rank of their difference is greater than or equal to d. A d -code with as many as possible elements is called a maximum d -code. The integer d is also called the minimum distance of the code. When d < n , a classical example of such an object is the so-called generalized Gabidulin code (Gabidulin and Kshevetskiy (2005)). In Delsarte and Goethals (1975), Schmidt (2015) and K.U. Schmidt (2018), several classes of maximum d -codes made up respectively of symmetric, alternating and Hermitian matrices were exhibited. In this article we focus on such examples. Precisely, we determine their automorphism groups and solve the equivalence issue for them. Finally, we exhibit a maximum symmetric 2-code which is not equivalent to the one with same parameters constructed in Schmidt (2015). [ABSTRACT FROM AUTHOR]