IEICE TRANSACTIONS on Fundamentals
On Two Strong Converse Theorems for Discrete Memoryless Channels
Summary :
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örner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. 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örner.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.12 pp.2471-2475
- Publication Date
- 2015/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.2471
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Shannon Theory
Authors
Yasutada OOHAMA
The University of Electro-Communications
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasutada OOHAMA, "On Two Strong Converse Theorems for Discrete Memoryless Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 12, pp. 2471-2475, December 2015, doi: 10.1587/transfun.E98.A.2471.
Abstract: 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örner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. 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örner.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.2471/_p
Copy
@ARTICLE{e98-a_12_2471,
author={Yasutada OOHAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Two Strong Converse Theorems for Discrete Memoryless Channels},
year={2015},
volume={E98-A},
number={12},
pages={2471-2475},
abstract={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örner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. 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örner.},
keywords={},
doi={10.1587/transfun.E98.A.2471},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - On Two Strong Converse Theorems for Discrete Memoryless Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2471
EP - 2475
AU - Yasutada OOHAMA
PY - 2015
DO - 10.1587/transfun.E98.A.2471
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2015
AB - 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örner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. 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örner.
ER -
English
