Unique Decoding of Explicit Epsilon-Balanced Codes Near the Gilbert–Varshamov Bound
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 24-minute IEEE conference talk delving into the unique decoding of explicit epsilon-balanced codes near the Gilbert–Varshamov bound. Learn about the error model, key coding theory concepts, and the relationship between expanders and distance amplification. Gain insights into the techniques used for unique decoding, including a bird's eye view of the process. Discover the research findings presented by authors Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, and Madhur Tulsiani from the University of Chicago and TTIC as they discuss their work in this specialized area of information theory.
Syllabus
Intro
Goal of the Talk
Error Model
Coding Theory Concepts
Expansion and Distance Amplification
Expanders and Distance Amplification
Bird's eye view of Unique Decoding
Techniques
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube