On Monday, we studied the error correctability (and detectability) of the parity and repetition codes. We also looked at some ways of modeling noise. The material was from Sec 1.3 in the book.
A reminder that tomorrow, Jesse will present the lecture. He will talk about the distance parameter of a code.
Advertisement
I couldn’t understand the part which states the relation between the error pattern and size of the alphabet in section 1.3.1
//
If the error pattern is (1,0,1,0,0,0) and alphabet is {0,1} then it has 2 errors. if alphabet is {0,1}3 then it has only one error.
//
By: Praveen Kumar on February 13, 2012
at 6:29 pm
HI Praveen,
Hopefully the binary part is clear: if you look at the vector
then it has two non-zero values and hence has 2 errors. However, if we think of the vector as 
– i.e. the vector only has two symbols each from 
, then this vector has only one non-zero symbols and hence, has one error.
Does the above make more sense?
By: atri on February 13, 2012
at 8:30 pm
Hello Professor,
Now, I understood it completely .Thank you
By: praveen kumar on February 14, 2012
at 6:28 pm
OK, great. You’re welcome.
By: atri on February 14, 2012
at 8:39 pm