Capacity Bounds for Sticky Channels

13 years 4 months ago

Download www.eecs.harvard.edu

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

Real-time Traffic

Insertion Channels | Multiple Times | Sticky Channels | TIT 2008 |

claim paper

» Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative RelayBroadca...

» Outer bound and noisyinterference sumrate capacity for symmetric Gaussian interference cha...

» Capacity Regions and Bounds for a Class of Zinterference Channels

» Tightness of capacity bounds in correlated MIMO systems with channel estimation error

» On the Capacity of the 2user Gaussian MAC Interfering with a P2P Link

» On the Capacity of OneSided Two User Gaussian Fading Broadcast Channels

» Outer Bounds for the Interference Channel with a Cognitive Relay

» On the capacity of interference channels with one cooperating transmitter

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TIT
Authors	Michael Mitzenmacher

Comments (0)

Sciweavers

Capacity Bounds for Sticky Channels

Insertion Channels | Multiple Times | Sticky Channels | TIT 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers