Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounds on List Decoding Gabidulin Codes   An open question about Gabidulin codes is whether polynomial-time list
decoding beyond half the minimum distance is possible or not. In this
contribution, we give a lower and an upper bound on the list size, i.e., the
number of codewords in a ball around the received word. The lower bound shows
that if the radius of this ball is greater than the Johnson radius, this list
size can be exponential and hence, no polynomial-time list decoding is
possible. The upper bound on the list size uses subspace properties.

33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio