Three Results on the Discrete Memoryless Broadcast Channel

By

Professor Chandra Nair
Department of Information Engineering
The Chinese University of Hong Kong

Date: Feb 2, 2009

Time: 4:30p.m. - 5:30p.m.

Venue: Rm. 121, Ho Sin Hang Engineering Building, CUHK

Abstract :

In this talk I will present three new results that were obtained last year in broadcast channel.

Result 1 answers the following question: What is the capacity region for the 2-receiver broadcast channel when one of the channels is the binary symmetric channel and the other is a binary erasure channel.

Result 2 (joint with my student Zizhou "Vincent" Wang) concerns a study of the inner and outer bounds for a class of 3-receiver broadcast channels with 2-degraded messages. We will produce an example where the bounds differ and use a "new" argument to show the tightness of the inner bound.

Result 3 establishes an information theoretic inequality for the binary skew-symmetric broadcast channel. This produces the first example where the best known inner and outer bounds differ for the 2-receiver broadcast channel. The way the inequality is proved (and the only known proof of this) is very non-standard.

The ordering of the results is based on the techniques involved: from the traditional to the novel.