Papers
Topics
Authors
Recent
Search
2000 character limit reached

Evasive subspaces, generalized rank weights and near MRD codes

Published 25 Apr 2022 in math.CO, cs.IT, and math.IT | (2204.11791v1)

Abstract: We revisit and extend the connections between $\mathbb{F}{qm}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}{qm}k$. We give a unifying framework in which we prove in an elementary way how the parameters of a rank-metric code are related to special geometric properties of the associated evasive subspace, with a particular focus on the generalized rank weights. In this way, we can also provide alternative and very short proofs of known results on scattered subspaces. We then use this simplified point of view in order to get a geometric characterization of near MRD codes and a clear bound on their maximal length. Finally we connect the theory of quasi-MRD codes with $h$-scattered subspaces of maximum dimension, extending to all the parameters sets the already known results on MRD codes.

Citations (15)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.