On Lower Bounds for the Capacity of Deletion Channels
On Lower Bounds for the Capacity of Deletion Channels
复制标题
关于删除通道容量的下界
DOI：
10.1109/tit.2006.881832
复制
发表时间：
2006
影响因子：
2.5
通讯作者：
M. Mitzenmacher
中科院分区：
文献类型：
--
作者：
Eleni Drinea;M. Mitzenmacher
这种对应关系考虑二进制删除信道，其中位以概率d独立删除;它改进了Diggavi和Grossglauser建立的用于分析二进制删除信道容量的框架，改进了它们的下限。Diggavi和Grossglauser考虑了由一阶马尔可夫链生成码字的码本。它们只考虑典型输出，其中如果N位输入给出N（1-d）（1-epsi）位输出，则输出是典型的。这种对应关系的改进来自两个考虑。首先，使用了一个更强的概念，一个典型的输出通道，这产生了更好的界限，即使是由Diggavi和Grossglauser研究的码本。第二，码字生成的更一般的过程比一阶马尔可夫链被认为是
This correspondence considers binary deletion channels, where bits are deleted independently with probability d; it improves upon the framework used to analyze the capacity of binary deletion channels established by Diggavi and Grossglauser, improving on their lower bounds. Diggavi and Grossglauser considered codebooks with codewords generated by a first-order Markov chain. They only consider typical outputs, where an output is typical if an N bit input gives an N(1-d)(1-epsi) bit output. The improvements in this correspondence arise from two considerations. First, a stronger notion of a typical output from the channel is used, which yields better bounds even for the codebooks studied by Diggavi and Grossglauser. Second, codewords generated by more general processes than first-order Markov chains are considered