Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Evasive subspaces, generalized rank weights and near MRD codes (2204.11791v1)

Published 25 Apr 2022 in math.CO, cs.IT, and math.IT

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

We haven't generated a summary for this paper yet.