Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Two Strong Converse Theorems for Stationary Discrete Memoryless
  Channels   In 1973, Arimoto proved the strong converse theorem for the discrete
memoryless channels stating that when transmission rate $R$ is above channel
capacity $C$, the error probability of decoding goes to one as the block length
$n$ of code word tends to infinity. He proved the theorem by deriving the
exponent function of error probability of correct decoding that is positive if
and only if $R>C$. Subsequently, in 1979, Dueck and K\"orner determined the
optimal exponent of correct decoding. Arimoto's bound has been said to be equal
to the bound of Dueck and K\"orner. However its rigorous proof has not been
presented so far. In this paper we give a rigorous proof of the equivalence of
Arimoto's bound to that of Dueck and K\"orner.

19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph