Bounds on List Decoding Gabidulin Codes

@article{WachterZeh2012BoundsOL,
  title={Bounds on List Decoding Gabidulin Codes},
  author={Antonia Wachter-Zeh},
  journal={CoRR},
  year={2012},
  volume={abs/1205.0345}
}
Gabidulin codes can be seen as the analogs of Reed–Solomon (RS) codes in rank metric. There are several efficient decoding algorithms up to half the minimum rank distance. However, in contrast to RS codes, there is no polynomial-time list decoding algorithm; it is not even known, whether such an algorithm can exist or not. An exponential lower bound on the number of codewords in a ball of radius τ around the received word would prohibit polynomial-time list decoding since the list size can be… CONTINUE READING