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.

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: