BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Design and decoding of polar-like codes
DTSTART:20180629T100000
DTEND:20180629T120000
DTSTAMP:20260415T122027Z
UID:d257237218e47d4fa3108115f07d38cbcfacf16378fadc8677b4620c
CATEGORIES:Conferences - Seminars
DESCRIPTION:Kirill Ivanov\nEDIC candidacy exam\nExam president: Dr. Andrea
 s Burg\nThesis advisor: Prof. Ruediger Urbanke\nCo-examiner: Prof. Emre Te
 latar\n\nAbstract\nPolar codes are the first class of capacity-achieving c
 odes with low-complexity encoding and decoding algorithms. However\, their
  performance on finite lengths is quite poor due to the small minimal dist
 ance. Generalized Plotkin decomposition allows one to employ low-complexit
 y polar code decoding techniques for decoding powerful Reed-Muller and eBC
 H codes. However\, their performance under successive-cancellation (list) 
 decoding is significantly worse for small and moderate list sizes.\n\nIn t
 his proposal\, we examine various approaches to improve the decoding perfo
 rmance of codes which can be defined via polar-like decomposition\, with a
  special case of Reed-Muller codes. These techniques include both code con
 struction and decoding methods. We point out their drawbacks and suggest s
 ome ideas\, which can be used in order to get better performance.\n\nBackg
 round papers\nList Decoding of Polar Codes\, by I. Tal\, A. Vardy.\nPolar 
 subcodes\, by P. Trifonov\, V. Miloslavskaya.\nDecoding Reed-Muller Codes
  Using Minimum-Weight Parity Checks\, by  E. Santi\, et al.\n \n 
LOCATION:BC 229 https://plan.epfl.ch/?room==BC%20229
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR