Generalized Gabidulin codes over fields of any characteristic
From MaRDI portal
Publication:1650439
Abstract: We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin codes and provide a decoding algorithm which decode both errors and erasures. Then, we focus on codes over integer rings and how to decode them. We are then faced with the problem of the exponential growth of intermediate values, and to circumvent the problem, it is natural to propose to do computations modulo a prime ideal. For this, we study the reduction of generalized Gabidulin codes over number ideals codes modulo a prime ideal, and show they are classical Gabidulin codes. As a consequence, knowing side information on the size of the errors or the message, we can reduce the decoding problem over the integer ring to a decoding problem over a finite field. We also give examples and timings.
Recommendations
Cites work
- Algebraic coding theory
- Bilinear forms over a finite field, with applications to coding theory
- Coding and Cryptography
- Coding and Cryptography
- Coding for Errors and Erasures in Random Network Coding
- Highly resilient correctors for polynomials
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- scientific article; zbMATH DE number 3379024 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Linear codes using skew polynomials with automorphisms and derivations
- Maximum-rank array codes and their application to crisscross error correction
- On a Special Class of Polynomials
- On transform-domain error and erasure correction by Gabidulin codes
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
Cited in
(22)- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- Fast decoding of Gabidulin codes
- Roos bound for skew cyclic codes in Hamming and rank metric
- On decoding additive generalized twisted Gabidulin codes
- The rank-based cryptography library
- Equivalence and characterizations of linear rank-metric codes based on invariants
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Cardinal rank metric codes over Galois rings
- Duals of linearized Reed-Solomon codes
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Dual skew codes from annihilators: transpose Hamming ring extensions
- Rank-metric codes and their applications
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Division algebras and MRD codes from skew polynomials
- Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes
- Middle-products of skew polynomials and learning with errors
- LCD codes over Galois rings
- On the rank weight hierarchy of M-codes
- Rank-metric codes over arbitrary fields: bounds and constructions
- Using cyclic \((f,\sigma )\)-codes over finite chain rings to construct \(\mathbb{Z}_p\)- and \(\mathbb{F}_q[\![t]\!]\)-lattices
- Properties of subspace subcodes of Gabidulin codes
This page was built for publication: Generalized Gabidulin codes over fields of any characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650439)
