Lecture 10 Video 2 List Decoding Capacity Theorem

Summary

We nail down the problem we want to solve in the next few The Johnson bound says that any code with good distance has decent We state and unpack the formal definition of local We introduce a generalization of If we move to 256 signal levels now L uh is 256 here L was 4 and we're just going to plug in again Mary Wootters, Carnegie Mellon University We introduce a useful notion for thinking about the group testing problem. In this thesis defense, we will discuss the following results. 1. Exact sampling: We will present an efficient algorithm that, given a ... So far we've been considering adversarial errors -- what happens when the errors are random?