Evasive subspaces, generalized rank weights and near MRD codes

@article{Marino2022EvasiveSG,
  title={Evasive subspaces, generalized rank weights and near MRD codes},
  author={Giuseppe Marino and Alessandro Neri and Rocco Trombetti},
  journal={ArXiv},
  year={2022},
  volume={abs/2204.11791}
}
. We revisit and extend the connections between F q m -linear rank-metric codes and evasive F q -subspaces of F kq m . 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… 
1 Citations

Figures from this paper

Rank-Metric Lattices
TLDR
The notion of latticerank weights of a rank-metric code is introduced and their properties as combinatorial invariants and as code distinguishers for inequivalent codes are investigated and investigated.

References

SHOWING 1-10 OF 40 REFERENCES
Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric
TLDR
Borders for the parameters of a minimal rank-metric codes, a general existence result based on a combinatorial argument, and an explicit code construction for some parameter sets that uses the notion of a scattered linear set are made.
Scattered subspaces and related codes
TLDR
Examples of non-square MRD codes which are not equivalent to generalized Gabidulin or twistedGabidulin codes are obtained and they are classified having the same parameters as the ones in the connection.
Rank-metric codes, linear sets, and their duality
TLDR
This paper uses the MacWilliams identities to obtain information about the possible weight distribution of a linear set of rank n on a projective line and exploits the connection between two constructions for linear sets defined in Lunardon.
Generalized rank weights : a duality statement
TLDR
A statement for generalized rank weights of the dual code is derived, completely analogous to Wei's one for generalized Hamming weights, and the equality case of the r-generalized Singleton bound for the generalizedrank weights is characterized, in terms of the rank weight of theDual code.
On defining generalized rank weights
TLDR
The generalized rank weights are investigated, with a definition implied by the study of the generalized rank weight enumerator, and codes that are degenerate with respect to the rank metric are discussed.
Weight distribution of rank-metric codes
TLDR
A definition of rank defect for rank-metric codes is proposed, and it is proved that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum- rank codeword is the same.
A Polymatroid Approach to Generalized Weights of Rank Metric Codes
TLDR
A duality is established for these weights analogous to Wei duality for generalized Hamming weights of linear codes, which are derived from the notion of a (q, m)-polymatroid, due to Shiromoto, and how generalized weights can be defined for them.
Generalized weights: an anticode approach
Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework
TLDR
An algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring, is provided, which allows to construct twisted linearized Reed-Solomon codes, a new family of maximum sum-Rank distance codes extending at the same time Sheekey’s twisted Gabidulin codes in the rank metric and twisted Reed- Solomoncodes in the Hamming metric.
On dually almost MRD codes
...
...