Novel Bounds on the Capacity of the Binary Deletion Channel
Novel Bounds on the Capacity of the Binary Deletion Channel
复制标题
二进制删除通道容量的新界限
DOI：
--
复制
发表时间：
2008
影响因子：
2.5
通讯作者：
T. Duman
中科院分区：
文献类型：
--
作者：
D. Fertonani;T. Duman
我们给出了独立同分布二进制删除信道容量的新的界。通过向发送器和接收器提供关于适当定义的随机过程的精灵辅助信息来获得四个上界。由于一些建议的界限涉及无穷级数，我们还引入了可证明的不等式，从而导致更容易处理的结果。对于大多数删除概率的值，这些界改进了现有的界，并显著缩小了与可用下界的差距。利用相同的辅助过程，我们还得到了两个简单的信道容量下界，作为副产品，对于较低的删除概率，它们几乎与现有的最佳下界一样好。
We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since some of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds. Exploiting the same auxiliary processes, we also derive, as a by-product, two simple lower bounds on the channel capacity, which, for low values of the deletion probability, are almost as good as the best existing lower bounds.