Posted by: atri | March 9, 2012

Lect 19: More on Hashing

We saw the equivalence between (almost universal) hashes and (good distance) codes. We then saw an application in the data possession problem. The material is from Sections 12.3 and 12.4 in the book.

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: