BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/258
DTSTAMP:20230914T125916Z
SUMMARY:Simple Channel Coding Bounds
DESCRIPTION:Speaker: Naqueeb Ahmad Warsi\n\nAbstract: \nThis talk is based 
 on "Simple channel coding bounds" by Wang et al\, ISIT\, 2009. New channel
  coding converse and achievability bounds are derived for a single use of 
 an arbitrary channel. Both bounds are expressed using a quantity called th
 e “smooth 0-divergence”\, which is a generalization of R´enyi’s div
 ergence of order 0.\n
URL:https://www.tcs.tifr.res.in/web/events/258
DTSTART;TZID=Asia/Kolkata:20120316T150000
DTEND;TZID=Asia/Kolkata:20120316T163000
LOCATION:AG-69
END:VEVENT
END:VCALENDAR