MATHEMATICS (TURKISH, PHD) | |||||
PhD | TR-NQF-HE: Level 8 | QF-EHEA: Third Cycle | EQF-LLL: Level 8 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
MAT6007 | Coding Theory | Fall Spring |
3 | 0 | 3 | 8 |
The course opens with the approval of the Department at the beginning of each semester |
Language of instruction: | Tr |
Type of course: | Departmental Elective |
Course Level: | |
Mode of Delivery: | Face to face |
Course Coordinator : | Prof. Dr. SÜREYYA AKYÜZ |
Course Objectives: | To teach the fundamentals of error-correcting codes and how they can be applied to the design of error control systems. |
The students who have succeeded in this course; Obtain the fundamental parameters of a code. Describe iterative decoding techniques and their application to turbo codes and LDPC codes. Obtain a parity-check matrix and a generator matrix and of a linear code. |
Week 1: Introduction to error-correcting codes Week 2: Finite fields Week 3: Vector spaces over finite fields Week 4: Linear block codes Week 5: Hamming codes, Reed-Muller codes, Golay code Week 6: Cyclic codes Week 7: Binary BCH codes Week 8: Convolutional codes Week 9: Convolutional codes, Viterbi algorithm Week 10: Midterm exam Week 11: Turbo codes Week 12: Turbo codes, iterative algorithm Week 13: LDPC codes Week 14: Decoding of LDPC codes Week 15: General review Week 16: Final Exam |
Week | Subject | Related Preparation | |
1) | Introduction to error-correcting codes | ||
2) | Finite fields | ||
3) | Vector spaces over finite fields | ||
4) | Linear block codes | ||
5) | Hamming codes, Reed-Muller codes, Golay code | ||
6) | Cyclic codes | ||
7) | Binary BCH codes | ||
8) | Convolutional codes | ||
9) | Convolutional codes, Viterbi algorithm | ||
10) | Turbo codes | ||
12) | Turbo codes, iterative algorithm | ||
13) | LDPC codes | ||
14) | Decoding of LDPC codes |
Course Notes: | [1] Error Control Coding, Shu Lin, Daniel J. Costello, Jr. |
References: | [1] Theory and practice of Error Control Codes, Richard E. Blahut [2] Sweeney, P., Error Control Coding: From Theory to Practice, J. Wiley [3] Gallagher, Information theory and reliable communication, J. Wiley |
Semester Requirements | Number of Activities | Level of Contribution |
Attendance | 14 | % 0 |
Laboratory | 0 | % 0 |
Application | 0 | % 0 |
Field Work | 0 | % 0 |
Special Course Internship (Work Placement) | 0 | % 0 |
Quizzes | 0 | % 0 |
Homework Assignments | 5 | % 15 |
Presentation | 0 | % 0 |
Project | 1 | % 15 |
Seminar | 0 | % 0 |
Midterms | 1 | % 30 |
Preliminary Jury | % 0 | |
Final | 1 | % 40 |
Paper Submission | % 0 | |
Jury | % 0 | |
Bütünleme | % 0 | |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 45 | |
PERCENTAGE OF FINAL WORK | % 55 | |
Total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Laboratory | 0 | 0 | 0 |
Application | 0 | 0 | 0 |
Special Course Internship (Work Placement) | 0 | 0 | 0 |
Field Work | 0 | 0 | 0 |
Study Hours Out of Class | 14 | 3 | 42 |
Presentations / Seminar | 1 | 1 | 1 |
Project | 2 | 12 | 24 |
Homework Assignments | 5 | 10 | 50 |
Quizzes | 0 | 0 | 0 |
Preliminary Jury | 0 | ||
Midterms | 1 | 20 | 20 |
Paper Submission | 0 | ||
Jury | 0 | ||
Final | 1 | 21 | 21 |
Total Workload | 200 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |