Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
From MaRDI portal
Publication:2976883
DOI10.1109/TIT.2016.2532343zbMath1359.94867arXiv1501.04272OpenAlexW2571060464MaRDI QIDQ2976883
Netanel Raviv, Antonia Wachter-Zeh
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04272
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (8)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Unnamed Item ⋮ Linearized trinomials with maximum kernel ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ On the number of factorizations of polynomials over finite fields ⋮ Rank-Metric Codes and Their Applications
This page was built for publication: Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
