Packing and Covering Properties of Rank Metric Codes
Information Theory
2008-05-07 v4 math.IT
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.
Keywords
Cite
@article{arxiv.cs/0701098,
title = {Packing and Covering Properties of Rank Metric Codes},
author = {Maximilien Gadouleau and Zhiyuan Yan},
journal= {arXiv preprint arXiv:cs/0701098},
year = {2008}
}
Comments
23 pages, 1 table. Submitted to IEEE Transactions on Information Theory