Answers are grounded in this paper and cite their sources.
This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties.
No takes yet. Share an insight, caveat, or question.
Gadouleau et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: