Posted by: atri | September 10, 2007

Lecture 6: General Hamming codes

In today’s lecture we saw two alternate characterizations of the distance of a linear code. We also defined the general Hamming code and verified that it was a perfect code.

Before the alarm went off, I was taking about the perfect binary linear codes. In fact the only possible family of such codes are:

  • Hamming code
  • (n,1,n)_2 code for odd n. (Note that the only codewords are 0^n and 1^n.
  • A (23,12)_2 code defined by Golay.

The result was proven in a sequence of work including those by van Lint and Tietavainen.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s


%d bloggers like this: