Skip to Main content Skip to Navigation
Journal articles

Asymptotic behaviour of codes in rank metric over finite fields

Abstract : In this paper, we rst recall some basic facts about rank metric. We then derive an asymptotic equivalent of the minimum rank distance of codes that reach the rank metric GilbertVarshamov bound. We then derive an asymptotic equivalent of the average minimum rank distance of random codes. We show that random codes reach GV bound. Finally, we show that optimal codes in rank metric have a packing density which is bounded by functions depending only on the base eld and the minimum distance and show the potential interest in cryptographic applications.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01097293
Contributor : Pierre Loidreau <>
Submitted on : Friday, December 19, 2014 - 1:17:03 PM
Last modification on : Tuesday, December 17, 2019 - 10:10:03 AM
Document(s) archivé(s) le : Monday, March 23, 2015 - 5:46:40 PM

File

Metrique_v4.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01097293, version 1

Collections

Citation

P Loidreau. Asymptotic behaviour of codes in rank metric over finite fields. Designs, Codes and Cryptography, Springer Verlag, 2014, 71 (1), pp.105-118. ⟨hal-01097293⟩

Share

Metrics

Record views

134

Files downloads

244