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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: