BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Extremes of Random Coding Error Exponents - Dr. Albert Guillén i 
 Fàbregas\, CUED
DTSTART:20110216T141500Z
DTEND:20110216T150000Z
UID:TALK29900@talks.cam.ac.uk
CONTACT:Rachel Fogg
DESCRIPTION:In this talk\, we will briefly review Gallager's random coding
  achievability proof. We will show that Gallager's random coding error exp
 onent of an arbitrary binary-input memoryless symmetric channel is upper-b
 ounded 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 f
 or the aforementioned class of channels.\n
LOCATION:LR10\, Engineering\, Department of
END:VEVENT
END:VCALENDAR