Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Simple Proof of Threshold Saturation for Coupled Vector Recursions   Convolutional low-density parity-check (LDPC) codes (or spatially-coupled
codes) have now been shown to achieve capacity on binary-input memoryless
symmetric channels. The principle behind this surprising result is the
threshold-saturation phenomenon, which is defined by the belief-propagation
threshold of the spatially-coupled ensemble saturating to a fundamental
threshold defined by the uncoupled system.
  Previously, the authors demonstrated that potential functions can be used to
provide a simple proof of threshold saturation for coupled scalar recursions.
In this paper, we present a simple proof of threshold saturation that applies
to a wide class of coupled vector recursions. The conditions of the theorem are
verified for the density-evolution equations of: (i) joint decoding of
irregular LDPC codes for a Slepian-Wolf problem with erasures, (ii) joint
decoding of irregular LDPC codes on an erasure multiple-access channel, and
(iii) general protograph codes on the BEC. This proves threshold saturation for
these systems.

15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
4
The categories of this paper are: cond-mat