DocumentCode :
2498509
Title :
Covering Properties of Rank Metric Codes
Author :
Gadouleau, Maximilien ; Yan, Zhiyuan
Author_Institution :
Lehigh Univ., Lehigh
fYear :
2007
fDate :
26-30 Nov. 2007
Firstpage :
1446
Lastpage :
1450
Abstract :
In this paper, we investigate the covering properties of rank metric codes. We first study the properties of balls with rank radii, and derive several useful results. We then derive both upper and lower bounds on the minimal cardinality of a code with given length and rank covering radius. Using these bounds, we obtain some covering properties of linear rank metric codes.
Keywords :
error correction codes; error correction codes; rank covering radius; rank metric codes; Erbium; Error correction codes; Public key cryptography; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-1042-2
Electronic_ISBN :
978-1-4244-1043-9
Type :
conf
DOI :
10.1109/GLOCOM.2007.278
Filename :
4411188
Link To Document :
بازگشت