Module code: MTH7126U
Credits: 15.0
Semester: SEM2
Contact: Dr Ivan Tomasic
Overlap: In taking this module you cannot take MTH6108
Prerequisite: Before taking this module you must take MTH5112
This module provides a thorough introduction to the theory of error-correcting codes. The module begins with the essential definitions of alphabets, codes and error-correction, leading to the formulation of the main problem of coding theory. A variety of examples of codes are constructed, including parity-check codes. Several theorems giving bounds for the main coding theory problem are proved (the Plotkin bound, the Hamming bound and the Singleton bound). The module then looks at linear codes, beginning with a brief review of basic linear algebra before moving on to constructions of linear codes (such as the Hamming and Reed-Muller codes).
The module also explores communication via a noisy channel, exploring the notions of capacity and word error probability.
Connected course(s): UDF DATA
Assessment: 100.0% Examination
Level: 7
