One-weight codes in the sum-rank metric

TL;DR

This paper investigates the structure and classification of one-weight sum-rank metric codes, introducing new classes and partial results, with applications to finite geometry and bounds on code existence.

Contribution

It introduces and classifies constant rank-list sum-rank codes and explores the more general constant rank-profile codes, providing the first examples and structural insights.

Findings

Classification of constant rank-list sum-rank codes

Partial structural results for constant rank-profile codes

Connections between one-weight MSRD codes and finite geometric structures

Abstract

One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics - being equivalent to (direct sums of) simplex codes - the sum-rank metric presents a far more intricate landscape. In this work, we explore the geometry of one-weight sum-rank metric codes, focusing on three distinct classes. First, we introduce and classify \emph{constant rank-list} sum-rank codes, where each nonzero codeword has the same tuple of ranks, extending results from the rank-metric setting. Next, we investigate the more general \emph{constant rank-profile} codes, where, up to reordering, each nonzero codeword has the same tuple of ranks. Although a complete classification remains elusive, we present the first examples and partial structural results for this class. Finally, we consider one-weight codes that are also MSRD (Maximum Sum-Rank Distance) codes. For dimension two, constructions arise from partitions of scattered linear sets on projective lines. For dimension three, we connect their existence to that of special $2$-fold blocking sets in the projective plane, leading to new bounds and nonexistence results over certain fields.