Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem   The problem of Syndrome Decoding was proven to be NP-complete in 1978 and,
since then, quite a few cryptographic applications have had their security rely
on the (provable) difficulty of solving some instances of it. However, in most
cases, the instances to be solved follow some specific constraint: the target
weight is a function of the dimension and length of the code. In these cases,
is the Syndrome Decoding problem still NP-complete? This is the question that
this article intends to answer.

25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
3
The categories of this paper are: physics
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph