Posted by: atri | January 20, 2010

Leceture 3: Error-Correction and Noise Models

In today’s lecture, we reviewed the error correcting (and error-detecting) capabilities of the parity and the repetition code. We also looked at some popular noise models and concluded by defining the (minimum) distance of a code. The relevant lectures from Fall 07 are lecture 2 and lecture 3.

Kushal has volunteered for proof-reading Friday’s lecture. If you want to volunteer for a lecture next week, let me know.

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: