Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional
  Codes   Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC)
codes are known to be asymptotically good, in the sense that the minimum free
distance grows linearly with the constraint length. In this paper, we use a
protograph-based analysis of terminated LDPCC codes to obtain an upper bound on
the free distance growth rate of ensembles of periodically time-varying LDPCC
codes. This bound is compared to a lower bound and evaluated numerically. It is
found that, for a sufficiently large period, the bounds coincide. This approach
is then extended to obtain bounds on the trapping set numbers, which define the
size of the smallest, non-empty trapping sets, for these asymptotically good,
periodically time-varying LDPCC code ensembles.

37
The categories of this paper are: supr-con
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
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
30
The categories of this paper are: q-alg