BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20191025T225804Z
DTSTART;TZID=America/Los_Angeles:20191030T150000
DTEND;TZID=America/Los_Angeles:20191030T160000
TRANSP:OPAQUE
SUMMARY:BLISS Seminar: One-shot Information Theory via Poisson Processes
UID:129398-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:400 Cory Hall
DESCRIPTION:Cheuk Ting Li\, UC Berkeley\n\nIn information theory\, coding theorems are usually proved in the asymptotic regime where the blocklength tends to infinity. While there are techniques for finite blocklength analysis\, they are often more complex than their asymptotic counterparts. In this talk\, we study the use of Poisson processes in proving coding theorems\, which not only gives sharp one-shot and finite blocklength results\, but also gives significantly shorter proofs than conventional asymptotic techniques in some settings. Instead of using fixed-size random codebooks\, we construct the codebook as a Poisson process. We present a lemma\, called the Poisson matching lemma\, which can replace both packing and covering lemmas in proofs based on typicality. We then demonstrate its use in settings such as channel coding with channel state information at the encoder\, lossy source coding with side information at the decoder\, joint source-channel coding\, broadcast channels\, and distributed lossy source coding. This shows that the Poisson matching lemma is a viable alternative to typicality for most problems in network information theory.\n\nThe talk is based on a joint work with Prof. Venkat Anantharam (UC Berkeley).
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=129398&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20191025T225804Z
LAST-MODIFIED:20191025T230712Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR