Posted by: atri | February 5, 2010

## Lecture 10: Group Testing

In today’s lecture we first proved that the Hadamard code $C_{\mathrm{Had},r}$ has a distance of $2^{r-1}$. Then we moved on to the problem of group testing. We saw its original motivation of efficiently testing WW II soldiers for syphilis and then saw its formal definition (including the matrix form of the non-adaptive version). Next lecture, we are going to see tighter bounds on the smallest number of test required given $n$ and $d$.

Devanshu will be scribing today’s lecture.