Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel

被引:2
|
作者
Helal, Noha [1 ]
Bloch, Matthieu [2 ]
Nosratinia, Aria [1 ]
机构
[1] Univ Texas Dallas, Dept Elect Engn, Richardson, TX 75080 USA
[2] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
Encoding; Random variables; Recycling; Probability distribution; Signal resolution; Receivers; Interference channels; Channel resolvability; secrecy; cooperation; cribbing; COGNITIVE INTERFERENCE CHANNELS; CAPACITY; INFORMATION; SIMULATION;
D O I
10.1109/TIT.2020.2995565
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution according to Kullback-Leibler divergence. We analyze resolvability rates when one encoder cribs (i) the input of the other encoder; or the output of the other encoder, (ii) non-causally, (iii) causally, or (iv) strictly-causally. For scenarios (i)-(iii), we exactly characterize the channel resolvability region. For (iv), we provide inner and outer bounds for the channel resolvability region; the crux of our achievability result is to handle the strict causality constraint with a block-Markov coding scheme in which dependencies across blocks are suitably hidden. Finally, we leverage the channel resolvability results to derive achievable secrecy rate regions for each of the cribbing scenarios under strong secrecy constraints.
引用
收藏
页码:5429 / 5447
页数:19
相关论文
共 50 条
  • [1] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [2] The Quantum Multiple-Access Channel With Cribbing Encoders
    Pereg, Uzi
    Deppe, Christian
    Boche, Holger
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 3965 - 3988
  • [3] Resolvability theory for the multiple-access channel
    Steinberg, Y
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) : 472 - 487
  • [4] THE DISCRETE MEMORYLESS MULTIPLE-ACCESS CHANNEL WITH CRIBBING ENCODERS
    WILLEMS, FMJ
    VANDERMEULEN, EC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) : 313 - 327
  • [5] Multiple-Access Channel With Partial and Controlled Cribbing Encoders
    Asnani, Himanshu
    Permuter, Haim H.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2252 - 2266
  • [6] Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel
    Bracher, Annina
    Lapidoth, Amos
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (12) : 7627 - 7654
  • [7] On Feedback, Cribbing, and Causal State-Information on the Multiple-Access Channel
    Bracher, Annina
    Lapidoth, Amos
    Steinberg, Yossef
    [J]. 2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 134 - 138
  • [8] Low-Complexity Channel Resolvability Codes for the Symmetric Multiple-Access Channel
    Chou, Remi A.
    Bloch, Matthieu R.
    Kliewer, Jorg
    [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 466 - 470
  • [9] Secrecy over Multiple-Access Channel: A Game of Competition and Cooperation
    Chen, Yanling
    Koyluoglu, O. Ozan
    Vinck, A. J. Han
    [J]. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2019, 25 (08) : 904 - 924
  • [10] Multiple Access Channel with Unreliable Cribbing
    Huleihel, Wasim
    Steinberg, Yossef
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1491 - 1495