Duration: 21 weeks.
Number of lectures per week: 3
Assessment:
End-of-year Examination: One 3-hour examination
Description:
The finite fields \mathbbF_{pn}, their existence and uniqueness.
The second part of the course, given by Dr Purser, will cover:
Linear block codes, parity check matrices, Hamming codes.
Ideals and binary cyclic codes.
Finite fields and BCH codes.
Error-correcting techniques.
Some examples: CCITT, Ethernet, EBU, GSM.
Non-binary codes. Reed-Solomon codes.
Convolutional Codes.
Decoding of convolutional codes (Viterbi algorithm).
Theoretical foundations of coding theory: Information Theory.
Modelling channels, capacity and Shannon's theorem.
Bounds and limits.
Modulation and Signal/Noise Ratios.
Soft-decision decoding.
Trellis Code Modulation (TCM).
Multi-level Block Code Modulation (MBCM).