Extremes of Random Coding Error Exponents

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

• Dr. Albert Guillén i Fàbregas, CUED
• Wednesday 16 February 2011, 14:15-15:00
• LR10, Engineering, Department of.

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 Signal Processing and Communications Lab Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Computational Continuum Mechanics Group Seminars
• Featured lists
• Information Engineering Division seminar list
• Interested Talks
• LR10, Engineering, Department of
• School of Technology
• Signal Processing and Communications Lab Seminars
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.