The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
1973년에 Arimoto는 이산 메모리리스 채널에 대한 강력한 역정리를 증명했습니다. R 채널 용량을 초과합니다. C, 디코딩의 오류 확률은 블록 길이에 따라 1이 됩니다. n 코드 단어의 수는 무한대인 경향이 있습니다. 그는 다음과 같은 경우에만 양수인 올바른 디코딩의 오류 확률 지수 함수를 도출하여 정리를 증명했습니다. R > C. 그 후 1979년에 Dueck과 Körner는 올바른 디코딩의 최적 지수를 결정했습니다. 최근에 저자는 올바른 디코딩 확률에 대한 최적의 지수를 결정했으며 이는 Dueck 및 Körner가 결정한 것과 유사한 형태를 갖습니다. 이 논문에서 우리는 위의 Dueck과 Körner의 지수 함수가 채널 입력에 대한 비용 제약이 있는 경우에 대한 Arimoto의 경계 확장으로 간주될 수 있는 지수 함수에 대한 엄격한 증명을 제공합니다.
Yasutada OOHAMA
The University of Electro-Communications
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.
부
Yasutada OOHAMA, "Equivalence of Two Exponent Functions for Discrete Memoryless Channels with Input Cost at Rates above the Capacity" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2199-2204, December 2018, doi: 10.1587/transfun.E101.A.2199.
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. 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2199/_p
부
@ARTICLE{e101-a_12_2199,
author={Yasutada OOHAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Equivalence of Two Exponent Functions for Discrete Memoryless Channels with Input Cost at Rates above the Capacity},
year={2018},
volume={E101-A},
number={12},
pages={2199-2204},
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. 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.},
keywords={},
doi={10.1587/transfun.E101.A.2199},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - Equivalence of Two Exponent Functions for Discrete Memoryless Channels with Input Cost at Rates above the Capacity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2199
EP - 2204
AU - Yasutada OOHAMA
PY - 2018
DO - 10.1587/transfun.E101.A.2199
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
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. 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.
ER -