Saturating systems and the rank covering radius
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 sqm/q(k,), which is the minimum Fq-dimension of a q-system in Fqmk which is rank -saturating. This is equivalent to the covering problem in the rank metric. We obtain upper and lower bounds on sqm/q(k,) and evaluate it for certain values of k and . We give constructions of rank -saturating systems suggested from geometry.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.