On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels

Details On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels

2010-08-06

arxiv.org/abs/1008.1140v4

Computer Science

Information Theory

5 pages, 1 table

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230683