Packing and Covering Properties of Rank Metric Codes

Simple item page
dc.creatorGadouleau, Maximilien
dc.creatorYan, Zhiyuan
dc.date2007-01-16
dc.date2008-05-07
dc.date.accessioned2026-07-07T09:37:21Z
dc.date.available2026-07-07T09:37:21Z
dc.descriptionThis 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.
dc.description23 pages, 1 table. Submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0701098
dc.identifierhttp://arxiv.org/abs/cs/0701098
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160430
dc.subjectInformation Theory
dc.titlePacking and Covering Properties of Rank Metric Codes
dc.typetext

Files

Collections

arXiv