|Unit code:||MATH32031||Teaching period(s):||Semester 1|
|Credit Rating:||10||Available as a free choice unit?:||N
|Unit level:||Level 3||Offered by||School of Mathematics|
- MATH20201 - Algebraic Structures 1 (Compulsory)
To introduce students to a subject of convincing practical relevance that relies heavily on results and techniques from Pure Mathematics.
Coding theory plays a crucial role in the transmission of information. Due to the effect of noise and interference, the received message may differ somewhat from the original message which is transmitted. The main goal of Coding Theory is the study of techniques which permit the detection of errors and which, if necessary, provide methods to reconstruct the original message. The subject involves some elegant algebra and has become an important tool in banking and commerce.
- Other - 20%
- Written exam - 80%
Assessment Further Information
- Coursework: weighting 20%
- End of semester examination: two hours weighting 80%
On successful completion of this course unit students will
- have a theoretical understanding of how methods of linear and polynomial algebra are applied in design of error correcting codes,
- and be able to analyse and compare error detecting/correcting facilities of simple linear and cyclic codes for the symmetric binary channel;
- be able to design simple cyclic codes with given properties.
- Introduction to the Main Problem of Coding Theory. [1 lecture]
- Hamming Distance. Code detection. Code correction. ISBN code. 
- Length and weight of a code. Perfect codes. 
- Linear codes. Generator matrices and standard forms. Encoding. Nearest neighbour decoding. 
- Dual code. Parity check matrix. Syndrome decoding. Incomplete decoding. 
- Hamming Codes and Decoding. 
- Finite fields. Cyclic codes. 
- Reed-Muller codes.
R Hill, A First Course in Coding Theory, 1986, OUP.
- Lectures - 22 hours
- Tutorials - 11 hours
- Independent study hours - 67 hours
Teaching staffYuri Bazlov - Unit coordinator
Data source is Central CUIP