On the list decodability of rank-metric codes containing Gabidulin codes
From MaRDI portal
Publication:2119948
DOI10.1007/s10623-022-01022-6OpenAlexW3138181749WikidataQ114849775 ScholiaQ114849775MaRDI QIDQ2119948
Ferdinando Zullo, Paolo Santonastaso
Publication date: 31 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.07547
Related Items (1)
Cites Work
- Unnamed Item
- A new family of linear maximum rank distance codes
- Maximum scattered linear sets and complete caps in Galois spaces
- Generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Asymptotics of Moore exponent sets
- A geometric approach to rank metric codes and a classification of constant weight codes
- 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
- Fast operations on linearized polynomials and their applications in coding theory
- A characterization of linearized polynomials with maximum kernel
- A new family of MRD-codes
- New maximum scattered linear sets of the projective line
- Fast decoding of Gabidulin codes
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- On decoding additive generalized twisted Gabidulin codes
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)]
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- Linearized trinomials with maximum kernel
- Identifiers for MRD-codes
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Additive Rank Metric Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bounds on list decoding of MDS 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> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
- Some results on linearized trinomials that split completely
- A new family of maximum scattered linear sets in PG(1, q^6)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
- New semifields and new MRD codes from skew polynomial rings
- On the List Decodability of Rank Metric Codes
- Bounds on List Decoding of Rank-Metric Codes
- Maximum-rank array codes and their application to crisscross error correction
- Algorithmic Results in List Decoding
- Coding and Cryptography
This page was built for publication: On the list decodability of rank-metric codes containing Gabidulin codes
