Posted by: atri | January 24, 2011

Lecture 2: Definitions

In Friday’s lecture, Steve went over various important definitions. In particular, he motivated and defined the notion of rate (as a concept that nicely captures the notion of redundancy). He then defined the notion of error correction and error detection and also considered two specific codes: the repetition code and the parity code. The error correction and error detection capabilities of these two codes were also discussed. The relevant lectures notes from Fall 2007 are Lecture 1, 2 and 3.

In Monday’s lecture, we will see the notion of “distance,” which will give us a general tool to talk about the error correction (and detection) capabilities of codes.

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: