BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/454
DTSTAMP:20230914T125925Z
SUMMARY:A Hypothesis Testing Approach for Proving Inner Bounds for Some Inf
ormation Theoretic Problems
DESCRIPTION:Speaker: Naqueeb Ahmad Warsi\n\nAbstract: \nAbstract: Most of t
he achievability proofs in Information theory are based on the concept of
typicality. However\, this typicality technique does not seem to be good e
nough to give achievability bounds in the most general settings\, i.e. in
the one-shot or non-iid case. In this talk we will discuss a hypothesis te
sting technique for proving inner bounds for some information theoretic pr
oblems. In particular\, we will discuss about using hypothesis testing tec
hnique to prove achievable rates for point to point and multiple access ch
annel. If time permits we will also discuss the extension of this techniqu
e in the quantum case\, i.e.\, when the classical message is sent over the
quantum channel.\n
URL:https://www.tcs.tifr.res.in/web/events/454
DTSTART;TZID=Asia/Kolkata:20140207T143000
DTEND;TZID=Asia/Kolkata:20140207T160000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR