Posted by: atri | April 23, 2010

## Lecture 41: Group testing and list recovery

In today’s lecture, we saw how one can use the polynomial time error-less list recovery algorithm for Reed-Solomon codes to decode a $t\times n$ disjunct matrix in time $\mathrm{poly}(t)$ instead of the earlier $O(nt)$ time.

I forgot to mention this in class: the connection between list recovery and decoding of disjunct matrices was first observed by Guruswami and Indyk.