Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary
  Erasure Channel   In this paper, we present a novel way for solving the main problem of
designing the capacity approaching irregular low-density parity-check (LDPC)
code ensemble over binary erasure channel (BEC). The proposed method is much
simpler, faster, accurate and practical than other methods. Our method does not
use any relaxation or any approximate solution like previous works. Our method
works and finds optimal answer for any given check node degree distribution.
The proposed method was implemented and it works well in practice with
polynomial time complexity. As a result, we represent some degree distributions
that their rates are close to the capacity with maximum erasure probability and
maximum code rate.

20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
30
The categories of this paper are: q-alg
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn