BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Polar Codes on Compound Channels
DTSTART:20190716T101500
DTEND:20190716T121500
DTSTAMP:20260501T144309Z
UID:8f7b3139e3b7000b1c184558411f8d98ea256315ac578f5fb6411f92
CATEGORIES:Conferences - Seminars
DESCRIPTION:Reka Inovan\nEDIC candidacy exam\nExam president: Prof. Michae
 l Gastpar\nThesis advisor: Prof. Emre Telatar\nCo-examiner: Dr. Nicolas Ma
 cris\n\nAbstract\nAlthough  polar  codes  have  been  shown  to  ac
 hieve capacity for binary memoryless channel given a complete channel mode
 l\,  its  performance  under  channel  uncertainties  is  largely n
 ot  known.  In  this  proposal\,  we  will  discuss  the  theoret
 ical framework  for  channel  coding  under  some  form  of  chann
 el uncertainties  and  how  polar  codes  fit  into  this  framewo
 rk.  The first  paper  [1]  will  discuss  one  of  the  framewor
 k  for  derivingachievability  results  on  this  problem.  The  s
 econd  paper  [2]  will provide  a  counter-example  to  the  long
 -standing  converse  result\,hence  leaving  the  question  of  con
 verse  as  once  again  an  open question.  The  third  paper  [3
 ]  will  discuss  a  method  to  boundthe  compound  capacity  of
   polar  codes.  Finally\,  we  will  present several  future  res
 earch  direction  which  will  extend  the  method given  in  [3]
   to  obtain  a  stronger  bound.\n\nBackground papers\nChannel capac
 ity for a given decoding metric\, by I. Csiszar and P. Narayan\, 1995.\nA 
 Counter-Example to the Mismatched Decoding Converse for Binary-Input Discr
 ete Memoryless Channels\, by - J. Scarlett\, A. Somekh-Baruch\, A. Martine
 z and A. Guillén i Fàbregas\, 2015.\nThe compound capacity of polar code
 s\, by S. H. Hassani\, S. B. Korada and R. Urbanke\, 2009.\n\n\n 
LOCATION:INR 113 https://plan.epfl.ch/?room=INR113
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR