In today’s lecture, we defined the notion of an -wise independent sources (as I mentioned in the lecture, these are generally called -wise independent sources but for us is already taken). We also saw how given an -wise independent sources, we can come up with a -approximation algorithm for the the MAXESAT problem. (In the problem, we are given a bunch of clauses where each clause has *exactly* literals. The goal is to come up with an assignment to the variables that satisfies as many clauses as possible.)

Next lecture, we will see that the dual of the code is an -wise independent source. By the bounds on the dimension of these codes, this means that we can get an -wise independent source of size . Further, as these codes are linear codes, each codeword can be generated in time . This implies, that we have an -approximation algorithm for MAXESAT that runs in time .

## Leave a Reply