University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > Extremes of Random Coding Error Exponents

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Extremes of Random Coding Error Exponents

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Fogg .

In this talk, we will briefly review Gallager’s random coding achievability proof. We will show that Gallager’s random coding error exponent of an arbitrary binary-input memoryless symmetric channel is upper-bounded by that of the binary erasure channel and lower-bounded by that of the binary-symmetric channel of the same capacity. We will illustrate how the result can be applied to find the extremes of the channel dispersion for the aforementioned class of channels.

This talk is part of the Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

CRASSH Seminar Room, 17 Mill Lane Castlereagh Room, Fisher Building, St John's College, Cambridge, CB2 1TP Engineering Department - Lecture Room 3

Other talks

Director's Briefing TBC Scientific Steering Committee meeting Title TBC Kirk Public Lecture: Title TBC Spectral rigidity of random covers of compact hyperbolic surfaces
 

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