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.
Originalsprog | Engelsk |
---|---|
Udgiver | arXiv |
Antal sider | 12 |
DOI | |
Status | Udgivet - 16 okt. 2024 |
Emneord
- math.CO
- cs.IT
- math.IT
- 05B40, 11T71, 51E20, 52C17, 94B75