Packing and Covering Properties of Rank Metric Codes
Maximilien Gadouleau, Zhiyuan Yan
TL;DR
This paper explores the packing and covering characteristics of rank metric codes, deriving bounds and analyzing their asymptotic behavior to enhance understanding of their geometric and combinatorial properties.
Contribution
It provides new bounds and insights into the packing and covering properties of rank metric codes, including their asymptotic behavior.
Findings
Derived bounds on rank metric code parameters
Analyzed asymptotic covering properties
Enhanced understanding of geometric properties of rank metric codes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications