Directly Lower Bounding the Information Capacity for Channels With I.I.D. Deletions and Duplications
Directly Lower Bounding the Information Capacity for Channels With I.I.D. Deletions and Duplications
复制标题
使用 I.I.D. 直接降低通道的信息容量界限
DOI：
--
复制
发表时间：
2007
影响因子：
2.5
通讯作者：
Adam Kirsch
中科院分区：
文献类型：
--
作者：
Eleni Drinea;Adam Kirsch
在本文中，我们直接下界信道的信息容量独立同分布（i.i.d.）删除和重复。我们的方法不同于以往的工作，我们专注于信息容量使用更新理论的想法，而不是专注于传输容量通过分析一些随机生成的代码使用组合参数的错误概率。当然，传输和信息容量是相等的，但我们的视角的变化允许一个更简单的分析，给出更一般的理论结果。然后，我们将这些结果应用到二进制删除通道，以提高其容量的现有下限。
In this paper, we directly lower bound the information capacity for channels with independent identically distributed (i.i.d.) deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmission capacity by analyzing the error probability of some randomly generated code using a combinatorial argument. Of course, the transmission and information capacities are equal, but our change of perspective allows for a much simpler analysis that gives more general theoretical results. We then apply these results to the binary deletion channel to improve existing lower bounds on its capacity.