arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.12426cs.ITmath.IT
收藏

对抗MAC上的零错误通信

Zero-Error Communication over Adversarial MACs

Yihan Zhang

摘要:

我们认为零错误的通信在两个发射机确定性对抗多址接入信道(MAC)的对手谁拥有访问的传输两个代理(因此称为无所不知),旨在恶意破坏通信。编码器、干扰器和解码器都不允许使用私有或公共随机性进行随机化。这加强了问题的组合性质。我们的模型涵盖了文献中研究的一个大家庭的通道,包括所有确定性离散无记忆噪声或无噪声MAC。在这项工作中,给定一个任意的两个发射机的确定性全知对抗MAC,我们刻画了当容量区域1)有非空的内部(特别是,是二维的); 2)由两个线段组成(特别是,有空的内部); 3)由一个线段组成(特别是,是一维的); 4)或仅包含$ (0,0) $(特别是,是零维的)。这将Wang,Budkuley,Bogdanov和Jaggi(2019)的最新结果从点对点设置扩展到多路访问设置。事实上,我们的逆论点建立在他们的广义Plotkin界,并涉及微妙的情况下分析。技术挑战之一是兼顾“联合混淆性”和“边缘混淆性”。特别是,边缘混淆性的治疗不遵循王等人的点对点结果。我们的可混淆性结果遵循随机编码与删减。

英文摘要:

We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains $ (0,0) $ (in particular, is zero-dimensional). This extends a recent result by Wang, Budkuley, Bogdanov and Jaggi (2019) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both "joint confusability" and "marginal confusability". In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑