Asymptotic behaviour of codes in rank metric over finite fields
From MaRDI portal
Publication:2439748
Abstract: We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric. We study the asymptotic behavior of the minimum rank distance of codes satisfying GV. We derive the probability distribution of minimum rank distance for random and random -linear codes. We give an asymptotic equivalent of their average minimum rank distance and show that random -linear codes are on GV bound for rank metric. We show that the covering density of optimum codes whose codewords can be seen as square matrices is lower bounded by a function depending only on the error-correcting capability of the codes. We show that there are quasi-perfect codes in rank metric over fields of characteristic 2.
Recommendations
Cites work
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 1759341 (Why is no real title available?)
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- Algebraic cryptanalysis of McEliece variants with compact keys
- Bilinear forms over a finite field, with applications to coding theory
- Coding and Cryptography
- Coding for Errors and Erasures in Random Network Coding
- Designing a Rank Metric Based McEliece Cryptosystem
- Limit distribution of the minimum distance of random linear codes
- Maximum-rank array codes and their application to crisscross error correction
- Modified GPT PKC with right scrambler
- New technique for decoding codes in the rank metric and its cryptography applications
- On Metrics for Error Correction in Network Coding
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- Packing and Covering Properties of Rank Metric Codes
- Random codes: minimum distances and error exponents
- Reducible rank codes and their applications to cryptography
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The security of the Gabidulin public key cryptosystem
- Theory of codes with maximum rank distance
Cited in
(13)- Asymptotically optimal matrix codes with Hamming and rank distances
- Densities of codes of various linearity degrees in translation-invariant metric spaces
- Packing and Covering Properties of Rank Metric Codes
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- Hamming and simplex codes for the sum-rank metric
- Rank-metric codes and their applications
- Density of free modules over finite chain rings
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Rank metric codes and zeta functions
This page was built for publication: Asymptotic behaviour of codes in rank metric over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439748)
