Almost Affine Vector Rank-Metric Codes

Abstract

We define almost affine vector rank-metric codes as subsets $\mathcal{C}\subseteq {\mathbb{F}}_{q^m}^n$ whose canonical projections have cardinalities that are powers of $q^m$, and prove that they naturally induce $q$-matroids. We establish that the operations of puncturing and shortening correspond to restriction and contraction of the $q$-matroid, and show that the rank-weight and formal dual distance distributions are determined by the induced $q$-matroid. We briefly discuss applications to perfect $q$-matroid ports in linear network coding, and show that disconnected $q$-matroids need not induce disconnected ports. Finally, we show that certain Additive Generalized Twisted Gabidulin codes yield direct examples of strictly almost affine rank-metric codes, alongside a separate construction derived from proper finite semifields.