BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1237
DTSTAMP:20230914T125956Z
SUMMARY:A brief introduction to polar codes
DESCRIPTION:Speaker: Sreejata Kishor Bhattacharya\n\nAbstract: \nIn his se
minal work in 1948 (A Mathematical Theory of Communication) Shannon introd
uced the capacity of a channel: the maximum rate at which information can
be reliably communicated across a channel. Shannon proved that for every m
emoryless channel there exists error correcting codes which achieve rate a
rbitrarily close to capacity. However Shannon's proof was an existential o
ne: he was unable to give any efficient encoding and decoding scheme that
would allow communication over a channel at rates close to capacity. This
remained a major open problem until 2008 when Erikan introduced polar code
s. These codes achieve Shannon capacity over any symmetric memoryless chan
nel\, and in special cases such as BSC (binary symmetric channel) and BEC
(binary erasure channel) have efficient decoding algorithms as well. We sh
all discuss polar codes in the special case of BSC: we shall give an overv
iew of their encoding and decoding schemes.\n
URL:https://www.tcs.tifr.res.in/web/events/1237
DTSTART;TZID=Asia/Kolkata:20220902T140000
DTEND;TZID=Asia/Kolkata:20220902T150000
LOCATION:A201
END:VEVENT
END:VCALENDAR