Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Towards Low-Complexity Linear-Programming Decoding   We consider linear-programming (LP) decoding of low-density parity-check
(LDPC) codes. While it is clear that one can use any general-purpose LP solver
to solve the LP that appears in the decoding problem, we argue in this paper
that the LP at hand is equipped with a lot of structure that one should take
advantage of. Towards this goal, we study the dual LP and show how
coordinate-ascent methods lead to very simple update rules that are tightly
connected to the min-sum algorithm. Moreover, replacing minima in the formula
of the dual LP with soft-minima one obtains update rules that are tightly
connected to the sum-product algorithm. This shows that LP solvers with
complexity similar to the min-sum algorithm and the sum-product algorithm are
feasible. Finally, we also discuss some sub-gradient-based methods.

37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
19
The categories of this paper are: eess
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin