|
1. |
Capacity Bounds for Sticky Channels
Mitzenmacher, M.;
Information Theory, IEEE Transactions on
Volume 54,
Issue 1,
Jan. 2008
Page(s):72
-
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.
|
Cart
