• DocumentCode
    1025621
  • Title

    Capacity Bounds for Sticky Channels

  • Author

    Mitzenmacher, Michael

  • Author_Institution
    Harvard Univ., Cambridge
  • Volume
    54
  • Issue
    1
  • fYear
    2008
  • Firstpage
    72
  • Lastpage
    77
  • Abstract
    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.
  • Keywords
    channel capacity; information theory; distributed duplication channel; insertion channel; sticky channel capacity bounds; Capacity planning; Channel capacity; Clocks; Codes; Costs; Keyboards; Timing; Upper bound; Capacity bounds; duplication channels; insertion/deletion channels; sticky channels;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2007.911291
  • Filename
    4418490
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1025621