Posted by: atri | February 9, 2010

## Lecture 11: Group testing bounds

In today’s lecture we saw that $\Theta(d\log{n})$ adaptive tests are necessary and sufficient for group testing when the input is an $n$ bit vector with Hamming weight at most $d$. We also saw a similar tight upper bound for non-adaptive group testing for $d=1$ using the parity check matrix of the Hamming code.

Andrew will scribe today’s lecture.

Next lecture we will go back to our main tradeoff of rate vs. relative distance.