Asymptotic behaviour of codes in rank metric over finite fields
From MaRDI portal
Publication:2439748
DOI10.1007/S10623-012-9716-0zbMATH Open1323.94181arXivcs/0610057OpenAlexW2047445372MaRDI QIDQ2439748FDOQ2439748
Authors: Pierre Loidreau 
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0610057
Recommendations
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Algebraic cryptanalysis of McEliece variants with compact keys
- Title not available (Why is that?)
- 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
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- Coding for Errors and Erasures in Random Network Coding
- Maximum-rank array codes and their application to crisscross error correction
- Packing and Covering Properties of Rank Metric Codes
- On Metrics for Error Correction in Network Coding
- Title not available (Why is that?)
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- New technique for decoding codes in the rank metric and its cryptography applications
- Random codes: minimum distances and error exponents
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The security of the Gabidulin public key cryptosystem
- Reducible rank codes and their applications to cryptography
- Limit distribution of the minimum distance of random linear codes
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- Modified GPT PKC with right scrambler
- Designing a Rank Metric Based McEliece Cryptosystem
- Title not available (Why is that?)
- Coding and Cryptography
Cited In (13)
- Asymptotically optimal matrix codes with Hamming and rank distances
- 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
- Rank-metric codes and their applications
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- Hamming and simplex codes for the sum-rank metric
- Density of free modules over finite chain rings
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Rank metric codes and zeta functions
- Densities of codes of various linearity degrees in translation-invariant metric spaces
Uses Software
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)
