Posted by: atri | August 31, 2007

Lecture 3: Error Correction and Distance of a code

In today’s lecture, we defined the notion of distance of a code and saw how closely it was related to the error correction capabilities of the code (for the worst-case noise model).

From next week on, we will pick up a bit of speed in the lectures. Please let me know at any point if I am going too fast. Also we will use finite fields and vector spaces in the next lecture, so if you want to be prepared/brush up your finite field basics read Madhu Sudan’s notes on algebra.

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: