Multiple Access Channels with Byzantine Users
Multiple Access Channels with Byzantine Users
复制标题
拜占庭用户的多个访问通道
DOI：
10.1109/itw44776.2019.8989065
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
V. Prabhakaran
中科院分区：
文献类型：
--
作者：
Neha Sangwan;Mayank Bakshi;B. Dey;V. Prabhakaran
研究了三用户多址信道（MAC）中任意一个用户的敌对行为。容量区域的特征是随机代码（其中每个用户与接收方共享一个独立的密钥）。研究了确定性码的容量区域。得到了该容量域非平凡的必要条件，其中包括一个新的非对称条件。研究结果表明，当所有用户都不对称时，确定性码也可以实现随机编码容量区域。这与Ahlswede和Cai（1991）对任意变化MAC的结果类似。
Communication over a three-user multiple access channel (MAC) is studied when any one of the users may behave adversarially. The capacity region is characterized for randomized codes (where each user shares an independent secret key with the receiver). The capacity region for deterministic codes is also studied. Necessary conditions including a new non-symmetrizability condition is obtained for this capacity region to be non-trivial. It is shown that when none of the users are symmetrizable, the randomized coding capacity region is also achievable with deterministic codes. This is analogous to the result of Ahlswede and Cai (1991) for arbitrarily varying MAC.