Linearized trinomials with maximum kernel
From MaRDI portal
Publication:2229961
DOI10.1016/j.jpaa.2021.106842OpenAlexW3197573237MaRDI QIDQ2229961
Paolo Santonastaso, Ferdinando Zullo
Publication date: 17 September 2021
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.14861
linearized polynomialclosed formularank metric codesubspace polynomialcyclic subspace codequasi-subfield polynomial
Related Items (4)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Multi-orbit cyclic subspace codes and linear sets ⋮ Constructions and equivalence of Sidon spaces ⋮ New results on quasi-subfield polynomials
Uses Software
Cites Work
- Unnamed Item
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- Automorphism groups of Gabidulin-like codes
- Generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Asymptotics of Moore exponent sets
- Galois theory and linear algebra
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Exceptional scattered polynomials
- A characterization of linearized polynomials with maximum kernel
- New results on quasi-subfield polynomials
- On the list decodability of rank-metric codes containing Gabidulin codes
- On the Menezes-Teske-Weng conjecture
- On the number of roots of some linearized polynomials
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- Equivalence and characterizations of linear rank-metric codes based on invariants
- On the classification of exceptional scattered polynomials
- A condition for scattered linearized polynomials involving Dickson matrices
- Scalar \(q\)-subresultants and Dickson matrices
- Cyclic subspace codes via subspace polynomials
- On kernels and nuclei of rank metric codes
- Identifiers for MRD-codes
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Subspace Polynomials and Cyclic Subspace Codes
- Affine Dispersers from Subspace Polynomials
- 13. MRD codes: constructions and connections
- Coding for Errors and Erasures in Random Network Coding
- Some results on linearized trinomials that split completely
- On the List Decodability of Rank Metric Codes
- Error-Correcting Codes in Projective Space
- Bounds on List Decoding of Rank-Metric Codes
- Cyclic Orbit Codes
- Construction of Sidon Spaces With Applications to Coding
This page was built for publication: Linearized trinomials with maximum kernel
