On the List Decodability of Rank Metric Codes

DOI10.1109/TIT.2020.2966974zbMath1448.94296arXiv1907.01289OpenAlexW3002383713MaRDI QIDQ5124510

Ferdinando Zullo, Rocco Trombetti

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.01289

zbMATH Keywords

lower boundsgeneralized Gabidulin codesgeneralized twisted Gabidulin codesMaximum Rank Distance (MRD) codes

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (6)

On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ On the number of roots of some linearized polynomials ⋮ Linearized trinomials with maximum kernel ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Rank-Metric Codes and Their Applications

This page was built for publication: On the List Decodability of Rank Metric Codes