University of Cambridge > Talks.cam > Communications Research Group Seminar > Second-order asymptotics in network information theory

Second-order asymptotics in network information theory

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dr Ramji Venkataramanan.

Shannon’s channel capacity is a first-order asymptotic quantity equal to the supremum of rates at which a decaying error probability can be achieved as the block length increases. Second-order coding rates provide a more refined indication of the system performance by quantifying the convergence speed of the coding rate to capacity for a given target error probability. This talk will review well-known results on the second-order asymptotics for point-to-point communication, and then overview some recent developments in network information theory problems. Achievability results will be provided for the multiple-access channel (MAC) and Gel’fand-Pinsker channel, and conclusive second-order asymptotic results (i.e. matching achievability and converse) will be provided for two Gaussian settings: the MAC with degraded message sets, and dirty paper coding.

This talk is part of the Communications Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity