EE Department Intranet -
Close window CTRL+W

ELEC97013 (EE4-07) Coding Theory

Lecturer(s): Dr Wei Dai


The goal is to help students gain skills and fundamental knowledge on finite fields, cryptography, and error correcting codes.

Learning Outcomes

Upon successful completion of this module, students will be able to:
1. Describe the fundamental mathematical concepts of and perform computations in finite fields - Finite fields
2. Analyse, deploy, and design encryption/decryption and digital signature schemes for secure information exchange – Cryptography
3. Detect and correct communication errors using popular error correcting codes, including Hamming codes, Reed-Solomon codes, and/or BCH codes, for reliable information exchange – Error correcting codes


Finite fields: definition, properties, primitive element, and polynomial factorisation on finite fields;
Cryptography: password storage and sharing, secret sharing, public key systems, and digital signature;
Concepts of error detection and correction. Linear codes, generator and parity checking matrices, distance, and Hamming codes;
Bounds to the performance of codes;
Reed Solomon codes, Cyclic and BCH codes;
Exam Duration: N/A
Coursework contribution: 100%

Term: Autumn

Closed or Open Book (end of year exam): N/A

Coursework Requirement:
Coursework involves paper study and 6 minute presentation. The detailed format and procedure will be announced in lectures.
The paper study is designed to encourage students to go beyond the taught materials and cultivate a good taste about important techniques
and applications. The final presentations will help students largely broaden their views of the topic, witness how their peers use their
judgement to choose a sub-topic to study, and get exposed to critical thinking of others.

Oral Exam Required (as final assessment): N/A

Prerequisite module(s): None required

Course Homepage:

Book List:
Please see Module Reading list