Equivalence of Two Exponent Functions for Discrete Memoryless Channels with Input Cost at Rates above the Capacity

Yasutada OOHAMA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.12   pp.2199-2204
Publication Date: 2018/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.2199
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Shannon theory
Keyword: 
stationary memoryless channels,  strong converse theorem,  information spectrum approach,  

Full Text: PDF(285.5KB)
>>Buy this Article


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. Recently the author determined the optimal exponent on the correct probability of decoding have the form similar to that of Dueck and Körner determined. In this paper we give a rigorous proof of the equivalence of the above exponet function of Dueck and Körner to a exponent function which can be regarded as an extention of Arimoto's bound to the case with the cost constraint on the channel input.