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.

中文翻译：

---

Cribbing 多址信道中的协作可解析性和保密性

我们研究了具有 cribbing 的离散无记忆多路访问信道的信道可解析性，即根据 Kullback-Leibler 散度近似产生选定的 iid 输出分布所需的随机性量的表征。当一个编码器抑制 (i) 另一个编码器的输入时，我们分析了可解析率；或其他编码器的输出，（ii）非因果，（iii）因果，或（iv）严格因果。对于场景 (i)-(iii)，我们准确地表征了通道可解析区域。对于（iv），我们提供了通道可解析区域的内边界和外边界；我们的可实现性结果的关键是使用块马尔可夫编码方案处理严格的因果关系约束，其中适当地隐藏了块之间的依赖关系。最后，