On decoding additive generalized twisted Gabidulin codes (Q2040309)

scientific article

Language	Label	Description	Also known as
English	On decoding additive generalized twisted Gabidulin codes	scientific article

Statements

instance of

scholarly article

0 references

title

On decoding additive generalized twisted Gabidulin codes (English)

0 references

zbMATH Open document ID

1469.94162

0 references

DOI

10.1007/s12095-020-00449-9

0 references

0 references

0 references

Cryptography and Communications

0 references

publication date

13 July 2021

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

rank metric

0 references

maximum rank distance codes

0 references

Gabidulin codes

0 references

twisted Gabidulin codes

0 references

generalized twisted Gabidulin codes

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s12095-020-00449-9

0 references

OpenAlex ID

W3045045786

0 references

cites work

Projective polynomials

0 references

On $x^{q+1}+ax+b$

0 references

Classes of Quadratic APN Trinomials and Hexanomials and Related Structures

0 references

Scalar $q$-subresultants and Dickson matrices

0 references

A characterization of linearized polynomials with maximum kernel

0 references

New maximum scattered linear sets of the projective line

0 references

Bilinear forms over a finite field, with applications to coding theory

0 references

New cyclic difference sets with Singer parameters

0 references

Niho type cross-correlation functions via dickson polynomials and Kloosterman sums

0 references

Q4037491

0 references

Theory of codes with maximum rank distance

0 references

Galois theory and linear algebra

0 references

Characterization of $m$-Sequences of Lengths $2^{2k}-1$ and $2^{k}-1$ With Three-Valued Cross Correlation

0 references

On the equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$

0 references

$X^{2^l+1}+x+a$ and related affine polynomials over $\mathrm{GF}(2^k$)

0 references

Coding for Errors and Erasures in Random Network Coding

0 references

Coding and Cryptography

0 references

Generalized twisted Gabidulin codes

0 references

Maximum rank distance codes as space~time codes

0 references

A characterization of the number of roots of linearized and projective polynomials in the field of coefficients

0 references

Additive Rank Metric Codes

0 references

On the number of roots of some linearized polynomials

0 references

Fast operations on linearized polynomials and their applications in coding theory

0 references

Maximum-rank array codes and their application to crisscross error correction

0 references

Tensor codes for the rank metric

0 references

A new family of linear maximum rank distance codes

0 references

13. MRD codes: constructions and connections

0 references

New semifields and new MRD codes from skew polynomial rings

0 references

Linearized Shift-Register Synthesis

0 references

A Rank-Metric Approach to Error Control in Random Network Coding

0 references

Probabilistic algorithm for finding roots of linearized polynomials

0 references

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>

0 references

Fast decoding of Gabidulin codes

0 references

Linearized polynomials over finite fields revisited

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2040309