Capacity bounds for sticky channels

被引：38
|
作者：
Mitzenmacher, Michael [1 ]
机构：
[1] Harvard Univ, Sch Engn & Appl Sci, Cambridge, MA 02138 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 01期
基金：
美国国家科学基金会;
关键词：
capacity bounds; duplication channels; insertion/deletion channels; sticky channels;
D O I：
10.1109/TIT.2007.911291
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight numerical upper and lower bounds for the independent and identically distributed (i.i.d.) duplication channel.
引用
收藏
页码：72 / 77
页数：6
相关论文
共 50 条
  • [1] Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
    Cheraghchi, Mahdi
    Ribeiro, Joao
    2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 1104 - 1111
  • [2] Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
    Cheraghchi, Mahdi
    Ribeiro, Joao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 6950 - 6974
  • [3] Bounds on the capacity of the unidirectional channels
    Tallini, LG
    IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (02) : 232 - 235
  • [4] Capacity bounds for LTI channels
    Nagy, Oliver
    Hanlen, Leif W.
    2008 AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP, 2008, : 29 - 32
  • [5] Bounds on the capacity of deletion channels
    Diggavi, SN
    Grossglauser, M
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 421 - 421
  • [6] On lower bounds for the capacity of deletion channels
    Drinea, Eleni
    Mitzenmacher, Michael
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (10) : 4648 - 4657
  • [7] LOWER BOUNDS IN CAPACITY OF PERMUTATION CHANNELS
    CHING, YC
    KURZ, L
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (02) : 134 - +
  • [8] On the Capacity Bounds for Poisson Interference Channels
    Lai, Lifeng
    Liang, Yingbin
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 223 - 238
  • [9] On lower bounds for the capacity of deletion channels
    Drinea, E
    Mitzenmacher, M
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 227 - 227
  • [10] Capacity Bounds for Networks of Broadcast Channels
    Effros, Michelle
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 580 - 584
12345