Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Trapping Redundancy of Linear Block Codes   We generalize the notion of the stopping redundancy in order to study the
smallest size of a trapping set in Tanner graphs of linear block codes. In this
context, we introduce the notion of the trapping redundancy of a code, which
quantifies the relationship between the number of redundant rows in any
parity-check matrix of a given code and the size of its smallest trapping set.
Trapping sets with certain parameter sizes are known to cause error-floors in
the performance curves of iterative belief propagation decoders, and it is
therefore important to identify decoding matrices that avoid such sets. Bounds
on the trapping redundancy are obtained using probabilistic and constructive
methods, and the analysis covers both general and elementary trapping sets.
Numerical values for these bounds are computed for the [2640,1320] Margulis
code and the class of projective geometry codes, and compared with some new
code-specific trapping set size estimates.

27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
19
The categories of this paper are: eess
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex