Posted by: atri | January 25, 2011

## Lecture 3: Minimum Distance

On Monday, we defined the notion of distance and stated the result that connected the distance of a code to its various error-correction capabilities. The relevant lecture notes from Fall 2007 is Lecture 3.

Next lecture, we will prove one  equivalence in the stated result and then present another code with distance $3$ with better rate than the repetition code.