Covering Radius of Matrix Codes Endowed with the Rank Metric
Eimear Byrne, Alberto Ravagnani · SIAM Journal on Discrete Mathematics · 2017
In this paper we study properties and invariants of matrix codes endowed with the rank metric and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening constructions. We give upper bounds on the covering radius of a code by applying different combinatorial methods. The various bounds are then applied to the classes of maximal-rank-distance and quasi-maximal-rank-distance codes.