Packing and Covering Properties of Rank Metric Codes
classification
💻 cs.IT
math.IT
keywords
propertiescodescoveringmetricrankpackinginvestigateasymptotic
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.