Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved linear programming decoding of LDPC codes and bounds on the
  minimum and fractional distance   We examine LDPC codes decoded using linear programming (LP). Four
contributions to the LP framework are presented. First, a new method of
tightening the LP relaxation, and thus improving the LP decoder, is proposed.
Second, we present an algorithm which calculates a lower bound on the minimum
distance of a specific code. This algorithm exhibits complexity which scales
quadratically with the block length. Third, we propose a method to obtain a
tight lower bound on the fractional distance, also with quadratic complexity,
and thus less than previously-existing methods. Finally, we show how the
fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can
be obtained.

30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat