科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we recall some basic facts about the rank metric. We derive an asymptotic equivalent of the minimum rank distance of codes that reach the rank metric Gilbert-Varshamov bound. We show that the random codes reach GV-bound. Finally, we show that the optimal codes in rank metric have a packing density which is bounded by functions depending only on the base field and on the minimum distance. We show the potential interest in cryptographic applications.
- 出版日期2014-4
