So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed-Solomon codes. In this paper, we provide bounds on the list size of rank-metric codes in order to understand whether polyn...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!