Posted by: atri | September 12, 2007

Lecture 7: Hadamard codes

In today’s lecture we defined the notions of code families and dual of a linear code. We then looked at the dual of Hamming code, the Simplex code (and the closely related Hadamard code). We saw that Hadamard/Simplex codes have great distance (later we will see that it is the best possible) but lousy rate (while Hamming codes have great rates but lousy distance).

Till now, we have focussed on the worst case noise model. In the next lecture, we will look into Shannon’s work on stochastic noise models.

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: