Rank-metric codes, linear sets, and their duality

From MaRDI portal
Publication:2306904



Abstract: In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary dimension, giving the connection between two constructions for linear sets defined in [9]. Finally, we then exploit this connection by using the MacWilliams identities to obtain information about the possible weight distribution of a linear set of rank n on a projective line PG(1,qn).


This is a nice paper on the theory of \({\mathbb F}_{q^n}\)-linear rank-metric codes and their links with subgeometries and, in particular, linear sets in higher dimension. The main theoretical result, contained in Sections 4 and 5, is unsurprising, in the sense that it is expected that being MRD corresponds to ``have minimal intersection with some geometric objects; the authors show that the appropriate notion in this case is ``being scattered with respect to hyperplanes which they introduce and discuss. This suggests also a close relationship with ordinary Hamming metric codes, as ``being scattered with respect to hyperplanes would there translate in a very nice upper bound on the minimum distance.




Cited in
(39)


Describes a project that uses

Uses Software






This page was built for publication: Rank-metric codes, linear sets, and their duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306904)