Error Correcting Codes

Notices

• Coursera Introduction

Lecture Notes

• Definition of statement (video), Combined statement (video)

• Method of proof (video) - https://class.coursera.org/maththink-002/class/index (Week 1 lectures are helpful !)

• Ch.1 exercises (video)

• Method of proof (pdf)

• Redundancy (video)

• Hamming weight (video)

• Exercise 3.4 (video1, video2, video3)

• 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)

• Lecture notes on April 16 (pdf_1, pdf_2, pdf_3)

  • Digital modem and error control coding using Matlab (pulse_shaping, modem_coding)

• Communication systems modeling and analysis using Simulnk (pdf_1, pdf_2) - you can download only this week.

• Space Time Block Code with Homework (video_1, video_2, video_3, video_4)

• Cyclic Code (video1, video2, video3, video4)

• How to generate Cyclic Code (video1, video2)

• 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)

Mid. & Final Scores

• The password should be entered to open the downloaded file (please download to check the grades).

Homeworks

• HW#2 (solution1, solution2, solution3)

  • HW#3 (pdf_1, pdf_2)

  • HW due to May 7.

    • 1) Is (7, 4) Hamming code a perfect code?

    • - Yes? Why? or No? Why?

    • 2) A Tanner graph is a graphical representation of the linear code based on the set of check equations.

    • Please read Definition 3.28 and Example 3.28, then draw a Tanner graph of (7, 4) Hamming code.

    • * 2)번은 Example 3.28을 읽고, (7,4) Hamming code의 H에 대하여 Tanner graph를 그리면 됨.