Maximum weight codewords of a linear rank metric code

02/02/2023

∙

by   Olga Polverino, et al.

∙

0

∙

share

Let 𝒞⊆𝔽_q^m^n be an 𝔽_q^m-linear non-degenerate rank metric code with dimension k. In this paper we investigate the problem of determining the number M(𝒞) of codewords in 𝒞 with maximum weight, that is min{m,n}, and to characterize those with the maximum and the minimum values of M(𝒞).