Asymptotic behaviour of codes in rank metric over finite fields
From MaRDI portal
Publication:2439748
DOI10.1007/s10623-012-9716-0zbMath1323.94181arXivcs/0610057OpenAlexW2047445372MaRDI QIDQ2439748
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0610057
Related Items (6)
Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Density of free modules over finite chain rings ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ On deep holes of Gabidulin codes ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Rank-Metric Codes and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- New technique for decoding codes in the rank metric and its cryptography applications
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The Security of the Gabidulin Public Key Cryptosystem
- Reducible rank codes and their applications to cryptography
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Designing a Rank Metric Based McEliece Cryptosystem
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- Coding for Errors and Erasures in Random Network Coding
- Packing and Covering Properties of Rank Metric Codes
- 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
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Random codes: minimum distances and error exponents
- On Metrics for Error Correction in Network Coding
- Limit distribution of the minimum distance of random linear codes
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: Asymptotic behaviour of codes in rank metric over finite fields
