Packing and Covering Properties of Rank Metric Codes

Authors:
M. Gadouleau;Zhiyuan Yan
Affiliations:
Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 6

Bounds on covering codes with the rank metric

IEEE Communications Letters
Subspace Codes

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Construction and covering properties of constant-dimension codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Packing and covering properties of subspace codes for error control in random linear network coding

IEEE Transactions on Information Theory
Constant-rank codes and their connection to constant-dimension codes

IEEE Transactions on Information Theory
Asymptotic behaviour of codes in rank metric over finite fields

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.96

Visualization

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.