Computer Science – Information Theory
Scientific paper
2008-07-23
Computer Science
Information Theory
3 pages, a note
Scientific paper
An outer bound to the two-receiver 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.
No associations
LandOfFree
An outer bound for 2-receiver discrete memoryless broadcast channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An outer bound for 2-receiver discrete memoryless broadcast channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An outer bound for 2-receiver discrete memoryless broadcast channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-485