On decoding additive generalized twisted Gabidulin codes
From MaRDI portal
Publication:2040309
DOI10.1007/s12095-020-00449-9zbMath1469.94162OpenAlexW3045045786MaRDI QIDQ2040309
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00449-9
Gabidulin codesrank metricmaximum rank distance codesgeneralized twisted Gabidulin codestwisted Gabidulin codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Other types of codes (94B60) Decoding (94B35)
Related Items (3)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Encoding and decoding of several optimal rank metric codes ⋮ Rank-Metric Codes and Their Applications
Cites Work
- Unnamed Item
- A new family of linear maximum rank distance codes
- On \(x^{q+1}+ax+b\)
- New cyclic difference sets with Singer parameters
- Generalized twisted Gabidulin codes
- Galois theory and linear algebra
- Probabilistic algorithm for finding roots of linearized polynomials
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Fast operations on linearized polynomials and their applications in coding theory
- A characterization of linearized polynomials with maximum kernel
- New maximum scattered linear sets of the projective line
- Fast decoding of Gabidulin codes
- On the number of roots of some linearized polynomials
- Scalar \(q\)-subresultants and Dickson matrices
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Linearized polynomials over finite fields revisited
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- Additive Rank Metric Codes
- 13. MRD codes: constructions and connections
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- Maximum rank distance codes as space~time codes
- Characterization of $m$-Sequences of Lengths $2^{2k}-1$ and $2^{k}-1$ With Three-Valued Cross Correlation
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Tensor codes for the rank metric
- Projective polynomials
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
- New semifields and new MRD codes from skew polynomial rings
- Linearized Shift-Register Synthesis
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: On decoding additive generalized twisted Gabidulin codes
