An outer bound for 2-receiver discrete memoryless broadcast channels

15 years 2 months ago

Download chandra.ie.cuhk.edu.hk

Abstract-- An outer bound to the discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Chandra Nair

Real-time Traffic

CORR 2008 | Discrete Memoryless Broadcast | Education | Memoryless | Outer Bound |

claim paper

» An outer bound to the capacity region of the broadcast channel

» Rate Regions for Relay Broadcast Channels

» The Relay Channel with a Wiretapper

» On the Equivalence of Two Achievable Regions for the Broadcast Channel

» Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance

» Secrecy capacity of a class of orthogonal relay eavesdropper channels

» Multiple Access Channels with State Information Known at Some Encoders

» Secure Communication over Parallel Relay Channel

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Chandra Nair

Comments (0)

Sciweavers

An outer bound for 2-receiver discrete memoryless broadcast channels

CORR 2008 | Discrete Memoryless Broadcast | Education | Memoryless | Outer Bound |

Explore & Download

Productivity Tools

Sciweavers