An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory
An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory
复制标题
用于证明网络信息论中的强逆定理的不等式
DOI：
10.1109/isit.2019.8849644
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Yasutada Oohama
中科院分区：
文献类型：
--
作者：
Bhaawan Gupta;Benjamin Ducharne;Tetsuya Uchimoto;Gael Sebald,Takamichi Miyazaki;Toshiyuki Takagi;Yasutada Oohama
本文给出了网络信息论中强逆定理证明的一个新的不等式。我们将这个不等式应用到Tyagi和Watanabe最近关于Wyner-Ziv信源编码问题的强逆定理的工作中，得到了一个新的强逆外界。该外界偏离源输出长度n的O(1/√n)量级的Wyner-Ziv率失真区域。
In this paper we provide a new inequality useful for the proofs of strong converse theorems in the network information theory. We apply this inequality to the recent work by Tyagi and Watanabe on the strong converse theorem for the Wyner-Ziv source coding problem to obtain a new strong converse outer bound. This outer bound deviates from the Wyner-Ziv rate distortion region with the order of O(1/√n) on the length n of source outputs.