Sciweavers

TIT
2008

Capacity Bounds for Sticky Channels

14 years 10 days ago
Capacity Bounds for Sticky Channels
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 i.i.d. duplication channel.
Michael Mitzenmacher
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TIT
Authors Michael Mitzenmacher
Comments (0)