Notices
Lecture notes 2013
Reading (Turing_pdf, Farnsworth_pdf)
Ex4.12 p139 (mp3)
Ex6.7 p202 (mp3)
Lecture Notes
Redundancy (video)
Hamming weight (video)
Definition 3.6, 3.7 (video)
Definition 3.8 (video)
BSC basic (video)
BSC simulation in Matlab (video)
Field (video)
Definition 3.9 (video)
Galois field (video)
GF(q^n) (video)
Span and GF(3) (video)
c = iG (video)
Exercise 3.9 (video)
Repetition and Hamming codes (video)
Correcting communication errors (video)
Space Time Block Code with Homework (video_1, video_2, video_3, video_4)
Convolution code, code tree and Viterbi algorithm (video_1, video_2, video_3, video_4, lecture note)
Convolution code ex. (video)
Prob. 4.1, 4.2, 4.4 and 4.7 (video1, video2, video3, video4)
Exercise 6.7 (pdf)
Mid & Final Scores
The password should be entered to open the downloaded file (please download to check the grades).
Home Work
#01, due to Mar. 12 (Wed.) sample solution note from a student, sol
#02, due to Apr. 2 (Wed.) sample solution note from a student, sol
#03, due to Apr. 9 (Wed.) sample solution note from a student, sol1 and sol2
#04: 1) Is (7, 4) Hamming code a perfect code? 2) Decode a rate-1/2 convolutional code having a few bit error.
#04, due to May. 14 (Wed.) sample solution note from a student, sol1, sol2 and sol3