Feb 16
We've now covered material through chap 5 in yellow Biggs text.
(Although he uses a slightly different notation.)
For example, problem 5.17, pg 87.
You should know what the channel capacity is,
and how to calculate it given a model of the errors
in terms of conditional probability
Next :
Chap 6: basic ideas of error correcting codes.
See
these notes; work a few problems and compare notations.
Concepts to understand :
BSC : binary symmetric channel (we've done this one)
extended BSC : n bits, each with same error probability
Hamming Distance between codes : number of bit flips
Minimum Distance Decision rule
Maximum Likelihood Decision rule (sometimes not the same!)
neighborhoods and disjoint neigborhoods
r-error correcting codes
packing bound - look at examples on pg 103
Do in class (time allowing) exercises at the top of 102.
