Rank-Metric Codes and Their Applications
From MaRDI portal
Publication:5863764
DOI10.1561/0100000119zbMath1490.94047arXiv2203.12384OpenAlexW4285144647MaRDI QIDQ5863764
Julian Renner, Antonia Wachter-Zeh, Hannes Bartz, Lukas Holzbaur, Sven Puchinger, Hedongliang Liu
Publication date: 3 June 2022
Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.12384
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Data structures (68P05) Decoding (94B35)
Uses Software
Cites Work
- Polynomial Time Algorithms for Multicast Network Code Construction
- Maximum rank distance codes as space~time codes
- Networks, Matroids, and Non-Shannon Information Inequalities
- A Random Linear Network Coding Approach to Multicast
- Designing a Rank Metric Based McEliece Cryptosystem
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Packing and Covering Properties of Rank Metric Codes
- Subspace Codes
- Codes as Modules over Skew Polynomial Rings
- Covering radius---Survey and recent results
- On generator matrices of MDS codes (Corresp.)
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Tensor codes for the rank metric
- Network information flow
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel
- On Decoding Rank-Metric Codes Over Large Fields
- The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
- Caching and Delivery via Interference Elimination
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Maximally Recoverable Codes for Grid-like Topologies
- Linear network coding
- Linear authentication codes: bounds and constructions
- Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
- On Metrics for Error Correction in Network Coding
- Partial MDS Codes With Regeneration
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- New semifields and new MRD codes from skew polynomial rings
- On the List Decodability of Rank Metric Codes
- Codes With Locality in the Rank and Subspace Metrics
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Constructions of Partial MDS Codes Over Small Fields
- Linearized Shift-Register Synthesis
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Algebraic Algorithms for Vector Network Coding
- Error-Correcting Codes in Projective Space
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Bounds on List Decoding of Rank-Metric Codes
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
- Efficient Encryption From Random Quasi-Cyclic Codes
- On identity testing of tensors, low-rank recovery and compressed sensing
- Progress in Cryptology – Mycrypt 2005
- Maximum-rank array codes and their application to crisscross error correction
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Rook Theory of the Finite General Linear Group
- Coding and Cryptography
- Coding and Cryptography
- Coding and Cryptography
- Coding and Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhanced public key security for the McEliece cryptosystem
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- On transform-domain error and erasure correction by Gabidulin codes
- Row reduction applied to decoding of rank-metric and subspace codes
- Algebraic decoding of folded Gabidulin codes
- Generalized twisted Gabidulin codes
- Coding with skew polynomial rings
- On (partial) unit memory codes based on Gabidulin codes
- MRD codes with maximum idealizers
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- Attacks and counter-attacks on the GPT public key cryptosystem
- Error and erasure correcting algorithms for rank codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- The Erdős-Ko-Rado theorem for vector spaces
- Bilinear forms over a finite field, with applications to coding theory
- Factoring in skew-polynomial rings over finite fields
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Fast operations on linearized polynomials and their applications in coding theory
- Rank metric codes and zeta functions
- Generalized Gabidulin codes over fields of any characteristic
- A new rank metric codes based encryption scheme
- Identity-based encryption from codes with rank metric
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- On the genericity of maximum rank distance and Gabidulin codes
- Column rank distances of rank metric convolutional codes
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- Gabidulin matrix codes and their application to small ciphertext size cryptosystems
- A new family of MRD-codes
- New maximum scattered linear sets of the projective line
- Column scrambler for the GPT cryptosystem
- New technique for decoding codes in the rank metric and its cryptography applications
- Theory of non-commutative polynomials
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Fast decoding of Gabidulin codes
- A complete classification of partial MDS (maximally recoverable) codes with one global parity
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- On decoding additive generalized twisted Gabidulin codes
- Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
- An algebraic attack on rank metric code-based cryptosystems
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)]
- An IND-CCA-secure code-based encryption scheme using rank metric
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Rank-metric codes, generalized binomial moments and their zeta functions
- A new rank metric for convolutional codes
- Low-rank parity-check codes over Galois rings
- Durandal: a rank metric based signature scheme
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- On the sparseness of certain linear MRD codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Symmetric rank codes
- Finite semifields and projective planes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Fast skew-feedback shift-register synthesis
- Linear codes using skew polynomials with automorphisms and derivations
- Asymptotic behaviour of codes in rank metric over finite fields
- Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
- Elliptic periods for finite fields
- Generalized twisted fields
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Upper bounds for constant-weight codes
- List decoding subspace codes from insertions and deletions
- Pseudorandomness
- The Security of the Gabidulin Public Key Cryptosystem
- Lattice Signatures without Trapdoors
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- On the Complexity of the Rank Syndrome Decoding Problem
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- On the Covering Radius of MDS Codes
- On List-Decodability of Random Rank Metric Codes and Subspace Codes
- List Decodability of Random Subcodes of Gabidulin Codes
- Additive Rank Metric Codes
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Explicit Maximally Recoverable Codes With Locality
- Codes With Local Regeneration and Erasure Correction
- A Family of Optimal Locally Recoverable Codes
- Fundamental Limits of Caching
- On the Locality of Codeword Symbols
- Decoding One Out of Many
- 13. MRD codes: constructions and connections
- A New Algorithm for Decoding Reed-Solomon Codes
- Isometries for rank distance and permutation group of gabidulin codes
- Network routing capacity
- Reducible rank codes and their applications to cryptography
This page was built for publication: Rank-Metric Codes and Their Applications