Session 4B - Optimally Resilient Codes for List-Decoding from Insertions and Deletions

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Designs optimally resilient codes for list-decoding under insertions and deletions. Teaching error-correcting code construction for insertion-deletion channels.

A 21-minute video from Association for Computing Machinery (ACM): “Session 4B - Optimally Resilient Codes for List-Decoding from Insertions and Deletions”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020