Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Hardness of Approximating Stopping and Trapping Sets in LDPC
  Codes   We prove that approximating the size of stopping and trapping sets in Tanner
graphs of linear block codes, and more restrictively, the class of low-density
parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are
that methods used for estimating the height of the error-floor of moderate- and
long-length LDPC codes based on stopping and trapping set enumeration cannot
provide accurate worst-case performance predictions.

33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg