Properties of Rank Metric Codes

Simple item page
dc.creatorGadouleau, Maximilien
dc.creatorYan, Zhiyuan
dc.date2007-02-13
dc.date2007-06-12
dc.date.accessioned2026-07-07T08:17:04Z
dc.date.available2026-07-07T08:17:04Z
dc.descriptionThis paper investigates general properties of codes with the rank metric. We first investigate asymptotic 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. Finally, we establish several identities that relate the rank weight distribution of a linear code to that of its dual code. One of our identities is the counterpart of the MacWilliams identity for the Hamming metric, and it has a different form from the identity by Delsarte.
dc.description44 pages, 3 figures. Submitted to IEEE Transactions on Information Theory on March 6th
dc.identifierhttps://arxiv.org/abs/cs/0702077
dc.identifierhttp://arxiv.org/abs/cs/0702077
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134000
dc.subjectInformation Theory
dc.titleProperties of Rank Metric Codes
dc.typetext

Files

Collections

arXiv