The maximum number of nonzero weights of linear rank-metric codes

TL;DR

This paper determines the maximum number of distinct nonzero rank weights in linear rank-metric codes, characterizes codes achieving full weight spectrum, and provides explicit constructions and classification results.

Contribution

It exactly computes the maximum weight spectrum for all parameters and characterizes when codes attain the full spectrum, including explicit constructions and classifications.

Findings

Exact value of maximum number of weights for all parameters

Conditions for codes to achieve full weight spectrum

Explicit constructions of maximum spectrum codes

Abstract

We investigate the maximum number \( L_{\mathrm{rk}}(n, m, k, q) \) of distinct nonzero rank weights that an \( \mathbb{F}_{q^m} \)-linear rank-metric code of dimension \( k \) in \( \mathbb{F}_{q^m}^n \) can attain. We determine the exact value of the function \( L_{\mathrm{rk}}(n, m, k, q) \) for all admissible parameters \( n, m, k, q \). In particular, we characterize when a code achieves the full weight spectrum (FWS), i.e. when the number of distinct nonzero rank weights equals \( \min\{n, m\} \). We provide both necessary and sufficient conditions for the existence of FWS codes, along with explicit constructions of codes attaining the maximum number of distinct weights. We discuss the equivalence of such codes and also present classification results for 2-dimensional codes. Finally, we investigate further properties of these optimal codes, like their behavior under duality.