MiS Preprint Repository

Delve into the future of research at MiS with our preprint repository. Our scientists are making groundbreaking discoveries and sharing their latest findings before they are published. Explore repository to stay up-to-date on the newest developments and breakthroughs.

MiS Preprint

The geometry of one-weight codes in the sum-rank metric

Alessandro Neri, Paolo Santonastaso and Ferdinando Zullo


We provide a geometric characterization of $k$-dimensional $\mathbb F_{q^m}$ linear sum-rank metric codes as tuples of $\mathbb F_q$-subspaces of $(\mathbb F_{q^m})^k$. We then use this characterization to study one-weight codes in the sum-rank metric. This leads us to extend the family of linearized Reed-Solomon codes in order to obtain a doubly-extended version of them. We prove that these codes are still maximum sum-rank distance (MSRD) codes and, when $k=2$, they are one-weight, as in the Hamming-metric case. We then focus on constant rank profile codes in the sum-rank metric, which are a special family of one weight codes, and derive constraints on their parameters with the aid of an associated Hamming-metric code. Furthermore, we introduce the $n$-simplex codes in the sum-rank metric, which are obtained as the orbit of a Singer subgroup of $\mathrm{GL}(k,q^m)$. They turn out to be constant rank-profile -- and hence one-weight -- and generalize the simplex codes in both the Hamming and the rank metric. Finally, we focus on $2$-dimensional one-weight codes, deriving constraints on the parameters of those which are also MSRD, and we find a new construction of one-weight MSRD codes when $q=2$.

Feb 11, 2022
Feb 14, 2022
MSC Codes:
11T71, 51E20, 11T06, 94B05
Sum-rank metric codes, one-weight codes, linear sets, simplex codes, linearized Reed-Solomon codes

Related publications

2023 Repository Open Access
Alessandro Neri, Paolo Santonastao and Ferdinando Zullo

The geometry of one-weight codes in the sum-rank metric

In: Journal of combinatorial theory / A, 194 (2023) 1, p. 105703