paper

Saturating systems and the rank covering radius

arXiv:2206.14740

Abstract

We introduce the concept of a rank saturating system and outline its correspondence to a rank-metric code with a given covering radius. We consider the problem of finding the value of , which is the minimum -dimension of a -system in which is rank -saturating. This is equivalent to the covering problem in the rank metric. We obtain upper and lower bounds on and evaluate it for certain values of and . We give constructions of rank -saturating systems suggested from geometry.

26 pages, to appear in Journal of Algebraic Combinatorics