Multiple-Access Channel Resolvability with Cribbing
Multiple-Access Channel Resolvability with Cribbing
复制标题
具有 Criribing 功能的多路访问通道分辨率
DOI：
10.1109/isit.2018.8437580
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Aria Nosratinia
中科院分区：
文献类型：
--
作者：
Noha Helal;M. Bloch;Aria Nosratinia
We study channel resolvability for the discrete memoryless multiple access channel with cribbing, i.e., the characterization of the amount of randomness required to approximate an i.i.d. output distribution in terms of Kullback-Leibler divergence. We analyze the cases in which one encoder cribs (i) the input of the other encoder; or the output of the other encoder (ii) noncausally, (iii) causally, or (iv) strictly-causally. For cases (i)-(iii), we exactly characterize the channel resolvability region. For case (iv), we provide inner and outer bounds for the channel resolvability region; our achievability result handles the strict causality constraint with a block-Markov coding scheme in which dependencies across blocks are suitably hidden.
