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

因果擦除通道

Causal Erasure Channels

Raef Bassily, Adam Smith

摘要:

我们考虑了二元因果对抗擦除信道的通信问题。这种信道将$n$输入比特映射到$\{0,1,\wedge\}$中的$n$输出符号,其中$\wedge$表示擦除。对于每个$i$,如果通道在观察位$i+1$至$n$之前,根据输入$1,...,i$反向决定是否擦除其输入的第$i$位,则通道是因果的。如果在整个传输持续时间内最多可以擦除输入位的$p$部分,则这样的通道是$p$受限的。因果通道为遵循基本物理限制但不可预测或高度可变的通道提供了一个自然模型。对于一个给定的擦除率$p$,我们的目标是要了解的最佳速率(容量),随机(随机)编码器/解码器可以可靠地传输所有因果$p$有界擦除信道。在本文中,我们引入了因果擦除模型,并提供了新的上限和下限的可达速率。我们的边界分离的因果擦除设置可实现的速率从两个相关的模型:随机擦除通道(严格较弱)和完全对抗擦除通道(严格较强)。具体而言,我们表明:-随机和因果擦除之间的严格分离,所有恒定的擦除率$p\in(0,1)$。- $p\in(0,ϕ)$的因果擦除和完全对抗擦除之间的严格分离,其中$ϕ\approx 0.348$。- 对于$p\in[ϕ,1/2)$,我们展示了因果擦除的代码,其速率高于完全对抗信道的最佳构造。我们的结果与纠正因果位翻转错误(与擦除相反)的现有结果形成鲜明对比[Dey et.等人2008,2009],[Haviv-Langberg 2011]。对于我们提供的分离,位翻转模型的类似分离要么根本不知道,要么弱得多。

英文摘要:

We consider the communication problem over binary causal adversarial erasure channels. Such a channel maps $n$ input bits to $n$ output symbols in $\{0,1,\wedge\}$, where $\wedge$ denotes erasure. The channel is causal if, for every $i$, the channel adversarially decides whether to erase the $i$th bit of its input based on inputs $1,...,i$, before it observes bits $i+1$ to $n$. Such a channel is $p$-bounded if it can erase at most a $p$ fraction of the input bits over the whole transmission duration. Causal channels provide a natural model for channels that obey basic physical restrictions but are otherwise unpredictable or highly variable. For a given erasure rate $p$, our goal is to understand the optimal rate (the capacity) at which a randomized (stochastic) encoder/decoder can transmit reliably across all causal $p$-bounded erasure channels. In this paper, we introduce the causal erasure model and provide new upper bounds and lower bounds on the achievable rate. Our bounds separate the achievable rate in the causal erasures setting from the rates achievable in two related models: random erasure channels (strictly weaker) and fully adversarial erasure channels (strictly stronger). Specifically, we show: - A strict separation between random and causal erasures for all constant erasure rates $p\in(0,1)$. - A strict separation between causal and fully adversarial erasures for $p\in(0,ϕ)$ where $ϕ\approx 0.348$. - For $p\in[ϕ,1/2)$, we show codes for causal erasures that have higher rate than the best known constructions for fully adversarial channels. Our results contrast with existing results on correcting causal bit-flip errors (as opposed to erasures) [Dey et. al 2008, 2009], [Haviv-Langberg 2011]. For the separations we provide, the analogous separations for bit-flip models are either not known at all or much weaker.

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

↑