Module designation | Coding Theory (MAL309) | ||||||||||||||
Semester(s) in which the module is taught | 5th | ||||||||||||||
Person responsible for the module | Bustomi, M.Si. | ||||||||||||||
Language | Indonesian | ||||||||||||||
Relation to curriculum | Compulsory /elective/specialization | ||||||||||||||
Teaching methods | Lecture, lesson, discussion, and presentation. | ||||||||||||||
Workload (incl. contact hours, self-study hours) | 2×170 minutes (2×50 minutes lecture and lesson, 2×60 minutes structural activities, 2×60 minutes self-study) per week for 16 weeks | ||||||||||||||
Credit points | 2 CP (3,2 ECTS) | ||||||||||||||
Required and recommended prerequisites for joining the module | Linear Algebra | ||||||||||||||
Module objectives/intended learning outcomes | General Competencies: Able to solve problems related to coding theory. Specific Competencies: Students are able to 1. Prove the basic properties of coding theory. 2. Determine the parameters and properties of linear code. 3. Determine limits on linear code. 4. Explain the types of special codes. | ||||||||||||||
Content | Introduction to coding theory, error detection, error correction, encoding and decoding, linear codes, building matrices, parity check matrices, Hamming weights, minimum distance, and boundaries in coding theory. | ||||||||||||||
Examination forms | Essay | ||||||||||||||
Study and examination requirements | Students are considered to pass if they at least have got a final score 40 (D). Final score is calculated as follows: 10% softskill+12% assignment+ 27% Quiz + 30% midterm + 21% final exam.
Final index is defined as follow:
| ||||||||||||||
Reading list | 1. San Ling, Chaoping Xing, 2004, Coding Theory: A First Course, Cambridge University Press, New York. 2. F. J. Macwilliams, N.J.A. Sloane, 2003, The Theory of Error-Correcting Codes, Nort-Holland Mathemtical Library. |