论文标题
因果对抗通道的能力
The Capacity of Causal Adversarial Channels
论文作者
论文摘要
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time.可实现的策略涉及随机编码以及列表解码和歧义步骤。匡威使用两相“ babble and-push”策略，其中对手在第一阶段随机选择状态，列表将输出解码，然后选择状态输入以在第二阶段对对称通道对称。这些结果将先前的工作推广到特定的通道模型（添加剂，擦除）到一般的离散字母和模型。
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time. The achievable strategy involves stochastic encoding together with list decoding and a disambiguation step. The converse uses a two-phase "babble-and-push" strategy where the adversary chooses the state randomly in the first phase, list decodes the output, and then chooses state inputs to symmetrize the channel in the second phase. These results generalize prior work on specific channels models (additive, erasure) to general discrete alphabets and models.
