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.
Funding Information
  • Agence Nationale de la Recherche (ANR-21-CE39-0009 - BARRACUDA)
  • Aalborg University

This publication has 33 references indexed in Scilit: