BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Coding theory\, additive combinatorics and machine learning
DTSTART:20250616T140000
DTEND:20250616T160000
DTSTAMP:20260405T153601Z
UID:c05c48f23080627c16c0d8ea3a5f5d1ccf9dec1a2be3619d04568ce0
CATEGORIES:Conferences - Seminars
DESCRIPTION:Vladyslav Shashkov\nEDIC candidacy exam jury\nExam president: 
 Prof. Rüdiger Urbanke\nThesis advisor: Prof. Emmanuel Abbé\nThesis co-ad
 visor: Prof. Maryna Viazovska\nCo-examiner: Prof. Florian Richter\n\nAbstr
 act\nAn important goal of coding theory is to identify capacity-achieving 
 code families. While Shannon's result proved that random codes achieve cap
 acity\, the search of deterministic codes remains open.  I contributed to
  a concise mathematical argument showing that Reed-Muller codes achieve we
 ak Shannon capacity. I aim to address the capacity conjecture for doubly t
 ransitive codes using mathematical tools such as Fourier sums\, with the g
 oal of advancing our understanding of highly symmetric\, capacity-achievin
 g codes.\n\nSelected papers\n1. "Channel polarization: A method for constr
 ucting capacity-achieving codes for symmetric binary-input memoryless chan
 nels"\, Erdal Arikan https://arxiv.org/pdf/0807.3917\n2. "Reed-Muller code
 s have vanishing bit-error probability below capacity: a simple tighter pr
 oof via camellia boosting"  Emmanuel Abbé and Colin Sandon\, https://ar
 xiv.org/pdf/2312.04329\n3. "On a conjecture of Marton"\, W. T. Gowers\, Be
 n Green\, Frederick Manners\, and Terence Tao\, https://arxiv.org/pdf/2311
 .05762\n \n 
LOCATION:MA B2 485 https://plan.epfl.ch/?room==MA%20B2%20485
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR