Insertion/deletion channels: reduced-state lower bounds on channel capacities
Insertion/deletion channels: reduced-state lower bounds on channel capacities
复制标题
插入/删除通道：通道容量的简化状态下限
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
R. Motwani
中科院分区：
文献类型：
--
作者：
A. Kavcic;R. Motwani
我们使用蒙特卡罗方法计算插入/删除通道的信息率下界。我们提出的信息率计算方法是基于简化状态网格技术的。我们将新获得的边界与以前的一些派生边界(特别是针对删除通道)进行比较，并表明新的边界(要尖锐得多)。在一些地区，新的上限几乎达到了已知的上限。
We use Monte-Carlo methods to compute lower bounds on information rates of insertion/deletion channels. The information rate computation methods we propose are based on reduced-state trellis techniques. We compare the newly obtained bounds to some previously derived bounds (specifically for the deletion channel) and show that the new bounds are (much) sharper. In some regions, the new bound almost meets a known upper bound.