On decoding additive generalized twisted Gabidulin codes
From MaRDI portal
Recommendations
Cites work
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- A characterization of linearized polynomials with maximum kernel
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- A new family of linear maximum rank distance codes
- 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>
- A Rank-Metric Approach to Error Control in Random Network Coding
- Additive Rank Metric Codes
- Bilinear forms over a finite field, with applications to coding theory
- 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 and Cryptography
- Coding for Errors and Erasures in Random Network Coding
- Fast decoding of Gabidulin codes
- Fast operations on linearized polynomials and their applications in coding theory
- Galois theory and linear algebra
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- Linearized polynomials over finite fields revisited
- Linearized Shift-Register Synthesis
- Maximum rank distance codes as space~time codes
- Maximum-rank array codes and their application to crisscross error correction
- MRD codes: constructions and connections
- New cyclic difference sets with Singer parameters
- New maximum scattered linear sets of the projective line
- New semifields and new MRD codes from skew polynomial rings
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- On \(x^{q+1}+ax+b\)
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- On the number of roots of some linearized polynomials
- Probabilistic algorithm for finding roots of linearized polynomials
- Projective polynomials
- Scalar \(q\)-subresultants and Dickson matrices
- Tensor codes for the rank metric
- Theory of codes with maximum rank distance
Cited in
(7)- Generalized Gabidulin codes over fields of any characteristic
- Encoding and decoding of several optimal rank metric codes
- On the list decodability of rank-metric codes containing Gabidulin codes
- A class of twisted generalized Reed-Solomon codes
- Rank-metric codes and their applications
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
- Permutation polynomials and finite projective spaces
This page was built for publication: On decoding additive generalized twisted Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040309)
