Abstract
We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems 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.
| Original language | English |
|---|---|
| Publisher | arXiv |
| Number of pages | 12 |
| DOIs | |
| Publication status | Published - 16 Oct 2024 |