List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
Information Theory
2014-04-24 v1 math.IT
Abstract
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.
Keywords
Cite
@article{arxiv.1404.5716,
title = {List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm},
author = {Margreta Kuijper and Anna-Lena Trautmann},
journal= {arXiv preprint arXiv:1404.5716},
year = {2014}
}
Comments
Submitted to ISITA 2014, IEICE copyright upon acceptance