The Discrete Memoryless Interference Channel With One-Sided Generalized Feedback and Secrecy

被引:2
作者
Bross, Shraga I. [1 ]
机构
[1] Bar Ilan Univ, Engn Dept, IL-52900 Ramat Gan, Israel
基金
以色列科学基金会;
关键词
Cognitive interference channel; generalized feedback; secrecy; MULTIPLE-ACCESS CHANNEL;
D O I
10.1109/TIT.2017.2676804
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the interference channel with one-sided generalized feedback and secrecy requirement. In our model Message 1 that is known just to Encoder 1 should be decoded by both receivers. Message 2-known only to Encoder 2-should be decoded by Decoder 2 and kept as secret as possible from Decoder 1. The uncertainty of Decoder 1 about Message 2 is measured by means of the equivocation rate. In addition, a noisy feedback is provided to Encoder 2. We derive an outer bound on the capacity-equivocation region for this model that is valid for the "noisy cribbing" regime. The gap between this upper bound and the inner bound reported before is just in the Markov conditions satisfied by one of the auxiliary random variables. Furthermore, we consider a simplified causal cognitive interference model: the interference channel with a cribbing encoder. We show that when, conditioned on the input of Encoder 1, the interference channel is degraded our outer bound is tight thereby establishing the capacity-equivocation region for this case.
引用
收藏
页码:2710 / 2725
页数:16
相关论文
共 8 条
[1]  
[Anonymous], 1990, Proceedings of the 1990 Symposium on Information Theory and its Applications (ISITA-90)
[2]  
[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[3]   The Discrete Memoryless Interference Channel With One-Sided Generalized Feedback [J].
Bross, Shraga I. ;
Steinberg, Yossef ;
Tinguely, Stephan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) :4171-4191
[4]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49
[5]   State amplification [J].
Kim, Young-Han ;
Sutivong, Arak ;
Cover, Thomas M. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) :1850-1859
[6]   Capacity of Cognitive Interference Channels With and Without Secrecy [J].
Liang, Yingbin ;
Somekh-Baruch, Anelia ;
Poor, H. Vincent ;
Shamai , Shlomo ;
Verdu, Sergio .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) :604-619
[7]   A new universal random coding bound for the multiple-access channel [J].
Liu, YS ;
Hughes, BL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :376-386
[8]   THE DISCRETE MEMORYLESS MULTIPLE-ACCESS CHANNEL WITH CRIBBING ENCODERS [J].
WILLEMS, FMJ ;
VANDERMEULEN, EC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :313-327