干扰信道中1比特跳频启动的好处和随机编码的必要性
The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels
摘要:
我们认为,在存在一个恶意的干扰对手(卡尔文),谁可以擦除任意一组高达$pn$位,出$n$传输位$(x_1,\ldots,x_n)$的消息$m$的通信问题。当卡尔文是完全因果的,即卡尔文的决定是否删除位$x_i$取决于他的观察$(x_1,\ldots,x_i)$的能力,这样的通道最近被表征为$1-2p$。在这项工作中,我们展示了两个(也许)令人惊讶的现象。首先,我们证明了通过一个新的代码结构,如果卡尔文延迟甚至一个单一的位,即卡尔文的决定是否删除位$x_i$只取决于$(x_1,\ldots,x_{i-1})$(和独立的“当前位”$x_i$),然后容量增加到$1-p$时,编码器被允许是随机的。其次,我们通过一种新的干扰策略卡尔文,在单比特延迟设置,如果编码是确定性的,(即所发送的码字是消息$m$的确定性函数)则在差错概率为零的情况下不可能有渐近大于$1-2p$的速率,因此,随机编码(在编码器处使用私有随机性)对于实现$1-p$相对于一比特延迟Calvin的容量是必要的。
英文摘要:
We consider the problem of communicating a message $m$ in the presence of a malicious jamming adversary (Calvin), who can erase an arbitrary set of up to $pn$ bits, out of $n$ transmitted bits $(x_1,\ldots,x_n)$. The capacity of such a channel when Calvin is exactly causal, i.e. Calvin's decision of whether or not to erase bit $x_i$ depends on his observations $(x_1,\ldots,x_i)$ was recently characterized to be $1-2p$. In this work we show two (perhaps) surprising phenomena. Firstly, we demonstrate via a novel code construction that if Calvin is delayed by even a single bit, i.e. Calvin's decision of whether or not to erase bit $x_i$ depends only on $(x_1,\ldots,x_{i-1})$ (and is independent of the "current bit" $x_i$) then the capacity increases to $1-p$ when the encoder is allowed to be stochastic. Secondly, we show via a novel jamming strategy for Calvin that, in the single-bit-delay setting, if the encoding is deterministic (i.e. the transmitted codeword is a deterministic function of the message $m$) then no rate asymptotically larger than $1-2p$ is possible with vanishing probability of error, hence stochastic encoding (using private randomness at the encoder) is essential to achieve the capacity of $1-p$ against a one-bit-delayed Calvin.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。