The geometry of covering codes in the sum–rank metric
Open Access
- 9 April 2025
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2993-3009
Abstract
We introduce the concept of a sum–rank saturating system and outline its correspondence to covering properties of a sum–rank metric code. We consider the problem of determining the shortest length of a sum–rank- $$\rho $$ -saturating system of a fixed dimension, which is equivalent to the covering problem in the sum–rank metric. We obtain upper and lower bounds on this quantity. We also give constructions of saturating systems arising from geometrical structures.
Keywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR-21-CE39-0009 - BARRACUDA)
- Aalborg University
This publication has 33 references indexed in Scilit:
- Saturating linear sets of minimal rankFinite Fields and Their Applications, 2024
- Geometric dual and sum‐rank minimal codesJournal of Combinatorial Designs, 2024
- Saturating systems and the rank-metric covering radiusJournal of Algebraic Combinatorics, 2023
- Linear cutting blocking sets and minimal codes in the rank metricJournal of Combinatorial Theory, Series A, 2022
- A geometric approach to rank metric codes and a classification of constant weight codesDesigns, Codes and Cryptography, 2020
- Minimal linear codes arising from blocking setsJournal of Algebraic Combinatorics, 2020
- Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ringJournal of Algebra, 2018
- Linear sets in finite projective spacesDiscrete Mathematics, 2010
- On Saturating Sets in Small Projective GeometriesEuropean Journal of Combinatorics, 2000
- Partitions of a vector spaceDiscrete Mathematics, 1980